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

DOI10.1137/0222002zbMATH Open0767.68080OpenAlexW1990802213MaRDI QIDQ4037680FDOQ4037680

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)

Cited In (8)

• Approximating minimum cuts under insertions
• Maintaining the classes of 4-edge-connectivity in a graph on-line
• The Common Structure of the Curves Having a Same Gauss Word
• Connectivity Oracles for Graphs Subject to Vertex Failures
• Maintaining triconnected components under node expansion
• Augmenting the edge connectivity of planar straight line graphs to three
• Decremental 2- and 3-connectivity on planar graphs
• Maintenance of triconnected components of graphs

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

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