Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time

DOI10.1006/JAGM.1998.0983zbMATH Open0923.68096OpenAlexW2009164011MaRDI QIDQ4238530FDOQ4238530

Authors: Hiroshi Nagamochi, Toshihide Ibaraki 

Publication date: 28 October 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/07ec7c0b963f23bae30de747ff430821077cad20

Recommendations

• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• Edge-connectivity augmentation problems
• Augmenting Graphs to Meet Edge-Connectivity Requirements

zbMATH Keywords

edge-connectivitygraph augmentation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
• Graph connectivity and its augmentation: Applications of MA orderings
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• Minimizing a monotone concave function with laminar covering constraints

This page was built for publication: Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time

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