Fully dynamic 2-edge-connectivity in planar graphs
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 233-244
- https://doi.org/10.1007/3-540-55706-7_20
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fully dynamic algorithms for edge connectivity problemsPublished by Association for Computing Machinery (ACM) ,1991
- Maintaining Bridge-Connected and Biconnected Components On-LinePublished by Defense Technical Information Center (DTIC) ,1989
- A new graphy triconnectivity algorithm and its parallelizationPublished by Association for Computing Machinery (ACM) ,1987
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969