Maintaining the classes of 4-edge-connectivity in a graph on-line
From MaRDI portal
Publication:1386336
Recommendations
- Maintaining the 3-Edge-Connected Components of a Graph On-Line
- scientific article; zbMATH DE number 7740902
- On the edge-connectivity of C₄-free graphs
- scientific article; zbMATH DE number 1617266
- A bound on 4-restricted edge connectivity of graphs
- Improved algorithms for graph four-connectivity
- Determining 4-Edge-Connected Components in Linear Time
- The edge C4graph of some graph classes
- On the number of 4-contractible edges in 4-connected graphs
- On Four-Connecting a Triconnected Graph
Cited in
(10)- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- scientific article; zbMATH DE number 1617266 (Why is no real title available?)
- Connectivity oracles for graphs subject to vertex failures
- The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
- Improved approximations for relative survivable network design
- Computing the 4-edge-connected components of a graph: an experimental study
- On maximal k-edge-connected subgraphs of undirected graphs
- Minimum+1 Steiner cut and dual edge sensitivity oracle: bridging gap between global and (s,t)-cut
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
This page was built for publication: Maintaining the classes of 4-edge-connectivity in a graph on-line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386336)
