Maintenance of triconnected components of graphs

DOI10.1007/3-540-55719-9_87MaRDI QIDQ5204330zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maintenance of 2- and 3-edge-connected components of graphs. I
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• The structure of a decomposition of a triconnected graph
• scientific article; zbMATH DE number 176746
• The connectivity carcass of a vertex subset in a graph and its incremental maintenance
• The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
• scientific article; zbMATH DE number 4083002
• Dynamic maintenance of planar digraphs, with applications
• Triangulating remnants of complete graphs

Cites work

• A linear-time algorithm for a special case of disjoint set union
• Alpha-algorithms for incremental planarity testing (extended abstract)
• Amortized efficiency of a path retrieval data structure
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Depth-First Search and Linear Graph Algorithms
• Dividing a Graph into Triconnected Components
• Fast incremental planarity testing
• Finding paths and deleting edges in directed acyclic graphs
• Fully Dynamic Algorithms for 2-Edge Connectivity
• scientific article; zbMATH DE number 432745 (Why is no real title available?)
• scientific article; zbMATH DE number 432746 (Why is no real title available?)
• scientific article; zbMATH DE number 432750 (Why is no real title available?)
• scientific article; zbMATH DE number 432790 (Why is no real title available?)
• scientific article; zbMATH DE number 3907787 (Why is no real title available?)
• scientific article; zbMATH DE number 4083002 (Why is no real title available?)
• scientific article; zbMATH DE number 177843 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Maintaining bridge-connected and biconnected components on-line
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Maintenance of 2- and 3-edge-connected components of graphs. I

Cited in

(9)

• On-line maintenance of triconnected components with SPQR-trees
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Dynamic 2- and 3-connectivity on planar graphs
• Fast incremental planarity testing
• Maintaining triconnected components under node expansion
• Average case analysis of fully dynamic connectivity for directed graphs
• Maintenance of 2- and 3-edge-connected components of graphs. I
• On maximal k-edge-connected subgraphs of undirected graphs

This page was built for publication: Maintenance of triconnected components of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204330)