On-line graph algorithms with SPQR-trees
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 598-611
- https://doi.org/10.1007/bfb0032061
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Area requirement and symmetry display in drawing graphsPublished by Association for Computing Machinery (ACM) ,1989
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Dynamic orthogonal segment intersection searchJournal of Algorithms, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Computing an st-numberingTheoretical Computer Science, 1976
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973