Successive edge-connectivity augmentation problems

DOI10.1007/s101070050041zbMath0939.05052OpenAlexW2116598440MaRDI QIDQ1300062

Tibor Jordán, Eddie Cheng

Publication date: 10 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050041

zbMATH Keywords

edge-connectivityarc-connectivitysuccessive augmentation property

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

On triconnected and cubic plane graphs on given point sets ⋮ Augmenting the connectivity of outerplanar graphs ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Augmenting the connectivity of geometric graphs ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete

This page was built for publication: Successive edge-connectivity augmentation problems