Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
From MaRDI portal
Publication:6102299
DOI10.1007/3-540-60313-1_142zbMath1517.68296OpenAlexW1572092079MaRDI QIDQ6102299
Monika R. Henzinger, Han La Poutré
Publication date: 8 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60313-1_142
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining bridge-connected and biconnected components on-line
- Improved data structures for fully dynamic biconnectivity
- Alpha-algorithms for incremental planarity testing (preliminary version)
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Separator based sparsification for dynamic planar graph algorithms