scientific article; zbMATH DE number 910886

MaRDI QIDQ4886060zbMATH OpenFDO

Authors Alek Vainshtein, Yefim Dinitz

Publication date 23 September 1996

zbMATH Keywords

cell structurecomplexityconnectivity carcassedge-connectivityincremental maintenancelocally orientable graphs

Mathematics Subject Classification ID

Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• The connectivity carcass of a vertex subset in a graph and its incremental maintenance
• Maintenance of 2- and 3-edge-connected components of graphs. I
• scientific article; zbMATH DE number 1617266

Cited in

(6)

• The connectivity carcass of a vertex subset in a graph and its incremental maintenance
• The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
• Space complexity of vertex connectivity oracles
• The structure of minimum vertex cuts
• Optimal sensitivity oracle for Steiner mincut
• Minimum+1 Steiner cut and dual edge sensitivity oracle: bridging gap between global and (s,t)-cut

This page was built for publication:

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