Maintenance of 2- and 3-edge- connected components of graphs I
- 28 April 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 114 (1-3) , 329-359
- https://doi.org/10.1016/0012-365x(93)90376-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Maintaining bridge-connected and biconnected components on-lineAlgorithmica, 1992
- Maintenance of triconnected components of graphsPublished by Springer Nature ,1992
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Fully dynamic techniques for point location and transitive closure in planar structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975