The minimum augmentation of any graph to aK-edge-connected graph
From MaRDI portal
Publication:3825104
DOI10.1002/net.3230190112zbMath0672.05057OpenAlexW2102671623MaRDI QIDQ3825104
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190112
polynomial algorithmadding edgesarbitrary multigraphk-edge- connected graphpolynomial augmentation algorithm
Related Items (18)
Structures of subpartitions related to a submodular function minimization ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ 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 ⋮ Minimizing a monotone concave function with laminar covering constraints ⋮ Edge-splittings preserving local edge-connectivity of graphs ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Independence free graphs and vertex connectivity augmentation ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem ⋮ Extremal graphs in connectivity augmentation ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects ⋮ Polyhedral structure of submodular and posi-modular systems ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees
This page was built for publication: The minimum augmentation of any graph to aK-edge-connected graph
