A dynamic data structure for planar graph embedding
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Small sets supporting fary embeddings of planar graphsPublished by Association for Computing Machinery (ACM) ,1988
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Dynamization of geometric data structuresPublished by Association for Computing Machinery (ACM) ,1985
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Efficient Planarity TestingJournal of the ACM, 1974