Maintenance of 2- and 3-edge-connected components of graphs. I

DOI10.1016/0012-365X(93)90376-5zbMath0795.05131OpenAlexW2050475090MaRDI QIDQ685694

Jan van Leeuwen, Johannes A. La Poutré, Mark H. Overmars

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90376-5

zbMATH Keywords

connectivitypathdynamic graph algorithm2- and 3-edge-connected components

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Decremental 2- and 3-connectivity on planar graphs ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Maintaining bridge-connected and biconnected components on-line ⋮ Maintenance of triconnected components of graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Unnamed Item

Cites Work

• Amortized efficiency of a path retrieval data structure
• Finding paths and deleting edges in directed acyclic graphs
• Maintaining bridge-connected and biconnected components on-line
• Parallel concepts in graph theory
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Maintenance of triconnected components of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item