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

DOI10.1137/0222002zbMATH Open0767.68080OpenAlexW1990802213MaRDI QIDQ4037680FDOQ4037680

Authors: 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

Recommendations

• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• Maintenance of 2- and 3-edge-connected components of graphs. I
• scientific article; zbMATH DE number 176746
• Maintenance of triconnected components of graphs
• Fully Dynamic Algorithms for 2-Edge Connectivity

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 (11)

• Approximating minimum cuts under insertions
• Maintaining the classes of 4-edge-connectivity in a graph on-line
• Maintaining triconnected components under node expansion
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II
• The common structure of the curves having a same Gauss word
• Title not available (Why is that?)
• Augmenting the edge connectivity of planar straight line graphs to three
• Maintenance of 2- and 3-edge-connected components of graphs. I
• Decremental 2- and 3-connectivity on planar graphs
• Connectivity oracles for graphs subject to vertex failures
• 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)