Fully dynamic 2-edge-connectivity in planar graphs
From MaRDI portal
Publication:5056144
DOI10.1007/3-540-55706-7_20zbMath1502.68231MaRDI QIDQ5056144
Monika R. Henzinger, J. E. Hershberger, Subhash Suri
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_20
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68P05: Data structures
05C40: Connectivity
Related Items
Dynamic 2- and 3-connectivity on planar graphs, Data structures for two-edge connectivity in planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining bridge-connected and biconnected components on-line
- A new graph triconnectivity algorithm and its parallelization
- An Efficient Parallel Biconnectivity Algorithm
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Dividing a Graph into Triconnected Components
- Depth-First Search and Linear Graph Algorithms