Maintaining the 3-Edge-Connected Components of a Graph On-Line
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1) , 11-28
- https://doi.org/10.1137/0222002
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Reducing edge connectivity to vertex connectivityACM SIGACT News, 1991
- 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
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969