Separator-Based Sparsification II: Edge and Vertex Connectivity
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (1) , 341-381
- https://doi.org/10.1137/s0097539794269072
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Decremental 2- and 3-Connectivity on Planar GraphsAlgorithmica, 1996
- Separator Based Sparsification: I. Planarity Testing and Minimum Spanning TreesJournal of Computer and System Sciences, 1996
- Data structures for two-edge connectivity in planar graphsTheoretical Computer Science, 1994
- On sparse subgraphs preserving connectivity propertiesJournal of Graph Theory, 1993
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex ConnectivitySIAM Journal on Computing, 1993
- Maintaining the 3-Edge-Connected Components of a Graph On-LineSIAM Journal on Computing, 1993
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphsJournal of Algorithms, 1988
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973