Fully Dynamic Algorithms for 2-Edge Connectivity

DOI10.1137/0221062zbMath0760.68022OpenAlexW2059138963MaRDI QIDQ4027863

Giuseppe F. Italiano, Zvi Galil

Publication date: 9 March 1993

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

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

zbMATH Keywords

vertex 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)

Decremental 2- and 3-connectivity on planar graphs ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Fast sequential importance sampling to estimate the graph reliability polynomial ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Maintenance of triconnected components of graphs

This page was built for publication: Fully Dynamic Algorithms for 2-Edge Connectivity