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

DOI10.1137/S0097539793257770zbMath0949.68055OpenAlexW2120239049MaRDI QIDQ4943881

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 algorithmsvertex connectivitydynamic data structuresedge connectivity

Mathematics Subject Classification ID

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

Related Items (5)

Augmenting the edge connectivity of planar straight line graphs to three ⋮ Fast sequential importance sampling to estimate the graph reliability polynomial ⋮ Maintenance of 2- and 3-edge-connected components of graphs. I ⋮ Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity ⋮ Maintenance of triconnected components of graphs

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