Data structures for two-edge connectivity in planar graphs
- 1 August 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 130 (1) , 139-161
- https://doi.org/10.1016/0304-3975(94)90156-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fully dynamic biconnectivity in graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Sparsification-a technique for speeding up dynamic graph algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A note on set union with arbitrary deunionsInformation Processing Letters, 1991
- Reducing edge connectivity to vertex connectivityACM SIGACT News, 1991
- 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
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972