Maintenance of 2- and 3-edge-connected components of graphs. I
From MaRDI portal
Publication:685694
DOI10.1016/0012-365X(93)90376-5zbMath0795.05131MaRDI QIDQ685694
Jan van Leeuwen, Mark H. Overmars, Johannes A. La Poutré
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Maintaining bridge-connected and biconnected components on-line, Decremental 2- and 3-connectivity on planar graphs
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