Maintenance of triconnected components of graphs

DOI10.1007/3-540-55719-9_87zbMath1427.68247OpenAlexW1552226600MaRDI QIDQ5204330

Johannes A. La Poutré

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_87

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items

Dynamic 2- and 3-connectivity on planar graphs, Average case analysis of fully dynamic connectivity for directed graphs, Maintenance of 2- and 3-edge-connected components of graphs. I, Fast incremental planarity testing

Cites Work

• Maintenance of 2- and 3-edge-connected components of graphs. I
• A linear-time algorithm for a special case of disjoint set union
• 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
• Alpha-algorithms for incremental planarity testing (preliminary version)
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Fully Dynamic Algorithms for 2-Edge Connectivity
• Dividing a Graph into Triconnected Components
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Fast incremental planarity testing
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item