Edge-Connectivity Augmentation Preserving Simplicity

DOI10.1137/S0895480197318878zbMath0915.05079OpenAlexW2010478727MaRDI QIDQ4210226

Jörgen Bang-Jensen, Tibor Jordán

Publication date: 21 September 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480197318878

zbMATH Keywords

combinatorial optimizationconnectivitynetwork designedge-connectivity augmentation of graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (9)

Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Splitting off edges between two subsets preserving the edge-connectivity of the graph. ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Edge-splittings preserving local edge-connectivity of graphs ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ Extremal graphs in connectivity augmentation ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects

This page was built for publication: Edge-Connectivity Augmentation Preserving Simplicity