Data structures for two-edge connectivity in planar graphs

DOI10.1016/0304-3975(94)90156-2zbMath0822.68022OpenAlexW1993766956MaRDI QIDQ1331953

Subhash Suri, Monika R. Henzinger, J. E. Hershberger

Publication date: 9 October 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90156-2

zbMATH Keywords

embedded planar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on set union with arbitrary deunions
• Maintaining bridge-connected and biconnected components on-line
• Parallel concepts in graph theory
• An Efficient Parallel Biconnectivity Algorithm
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Dividing a Graph into Triconnected Components
• Fully dynamic 2-edge-connectivity in planar graphs
• Separator based sparsification for dynamic planar graph algorithms
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Data structures for two-edge connectivity in planar graphs