Fast incremental planarity testing
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 342-353
- https://doi.org/10.1007/3-540-55719-9_86
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On-line graph algorithms with SPQR-treesPublished by Springer Nature ,1990
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Dynamic perfect hashing: upper and lower boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Two algorithms for maintaining order in a listPublished by Association for Computing Machinery (ACM) ,1987
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973