The minimum augmentation of any graph to aK-edge-connected graph

Recommendations

scientific article; zbMATH DE number 1555937
Minimum augmentation of a tree to a K-edge-connected graph
scientific article; zbMATH DE number 1617267
On the maximum size of a minimal \(k\)-edge connected augmentation
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
The minimum augmentation of a directed tree to ak-edge-connected directed graph
A minimum 3-connectivity augmentation of a graph
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
\(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.

Cited in

(24)

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
Extremal graphs in connectivity augmentation
The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Polyhedral structure of submodular and posi-modular systems
Independence free graphs and vertex connectivity augmentation
A survey of parameterized algorithms and the complexity of edge modification
Edge-splittings preserving local edge-connectivity of graphs
On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
On arborescence packing augmentation in hypergraphs
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Graph connectivity and its augmentation: Applications of MA orderings
On the maximum size of a minimal \(k\)-edge connected augmentation
Hypergraph connectivity augmentation in strongly polynomial time
Robustness and strong attack tolerance of low-diameter networks
Edge-connectivity augmentation problems
Minimum augmentation of a tree to a K-edge-connected graph
Structures of subpartitions related to a submodular function minimization
Edge-connectivity augmentations of~graphs~and~hypergraphs
Algorithm and complexity of the two disjoint connected dominating sets problem on trees
The minimum augmentation of a directed tree to ak-edge-connected directed graph
Minimizing a monotone concave function with laminar covering constraints
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem

This page was built for publication: The minimum augmentation of any graph to aK-edge-connected graph

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