Fully dynamic biconnectivity in graphs

DOI10.1007/BF01189067zbMath0826.68097MaRDI QIDQ1892579

Monika R. Henzinger

Publication date: 19 June 1995

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

graph algorithmsgraph connectivitydynamic algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (3)

Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs ⋮ Unnamed Item ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier

Cites Work

• Maintaining bridge-connected and biconnected components on-line
• A data structure for dynamic trees
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• On-line algorithms for polynomially solvable satisfiability problems
• Separator based sparsification for dynamic planar graph algorithms
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fully dynamic biconnectivity in graphs