Maintenance of triconnected components of graphs
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 354-365
- https://doi.org/10.1007/3-540-55719-9_87
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A dynamization of the All Pairs Least Cost Path ProblemPublished by Springer Nature ,2005
- Fast incremental planarity testingPublished by Springer Nature ,1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- On-line graph algorithms with SPQR-treesPublished by Springer Nature ,1990
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- 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
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972