Maintenance of 2- and 3-Edge-Connected Components of Graphs II

DOI10.1137/S0097539793257770MaRDI QIDQ4943881zbMATH OpenOpenAlexFDO

Authors Han La Poutré

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793257770

zbMATH Keywords

analysis of algorithmsdynamic data structuresedge connectivityvertex connectivity

Mathematics Subject Classification ID

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

Recommendations

• Maintenance of 2- and 3-edge-connected components of graphs. I
• Decremental 2- and 3-connectivity on planar graphs
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• Maintenance of triconnected components of graphs
• Fully Dynamic Algorithms for 2-Edge Connectivity

Cited in

(11)

• Incremental strong connectivity and 2-connectivity in directed graphs
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• Dynamic 2-Connectivity with Backtracking
• scientific article; zbMATH DE number 1003251 (Why is no real title available?)
• Fast sequential importance sampling to estimate the graph reliability polynomial
• Maintenance of triconnected components of graphs
• Augmenting the edge connectivity of planar straight line graphs to three
• Improved approximations for relative survivable network design
• Maintenance of 2- and 3-edge-connected components of graphs. I
• On maximal k-edge-connected subgraphs of undirected graphs
• Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity

This page was built for publication: Maintenance of 2- and 3-Edge-Connected Components of Graphs II

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