Pages that link to "Item:Q3825104"
From MaRDI portal
The following pages link to The minimum augmentation of any graph to aK-edge-connected graph (Q3825104):
Displaying 18 items.
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- Structures of subpartitions related to a submodular function minimization (Q1365312) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Edge-splittings preserving local edge-connectivity of graphs (Q2482096) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Extremal graphs in connectivity augmentation (Q4256090) (← links)
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (Q5101432) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
