Maintaining the 3-Edge-Connected Components of a Graph On-Line

DOI10.1137/0222002zbMath0767.68080OpenAlexW1990802213MaRDI QIDQ4037680

Giuseppe F. Italiano, Zvi Galil

Publication date: 16 May 1993

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

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

zbMATH Keywords

vertex connectivitydynamic data structuresedge connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

Decremental 2- and 3-connectivity on planar graphs ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Approximating minimum cuts under insertions ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ The Common Structure of the Curves Having a Same Gauss Word

This page was built for publication: Maintaining the 3-Edge-Connected Components of a Graph On-Line