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

DOI10.1006/jagm.1998.0983zbMath0923.68096OpenAlexW2009164011MaRDI QIDQ4238530

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

zbMATH Keywords

edge-connectivitygraph augmentation

Mathematics Subject Classification ID

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

Related Items (5)

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs ⋮ 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 ⋮ Graph connectivity and its augmentation: Applications of MA orderings

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