Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846): Difference between revisions

@@ Property / cites work @@
+Edge-Connectivity Augmentation Preserving Simplicity
+Normal rank
@@ Property / cites work @@
+The minimum augmentation of any graph to aK-edge-connected graph
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Efficient splitting off algorithms for graphs
@@ Property / cites work: Efficient splitting off algorithms for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230328
@@ Property / cites work: Q4230328 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Smallest Augmentation to Biconnect a Graph
+Normal rank
@@ Property / cites work @@
+Q4938784
@@ Property / cites work: Q4938784 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph
+Normal rank
@@ Property / cites work @@
+On the optimal vertex-connectivity augmentation
@@ Property / cites work: On the optimal vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the vertex-connectivity augmentation problem
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs
@@ Property / cites work: Augmenting Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Data Security Equals Graph Connectivity
@@ Property / cites work: Data Security Equals Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
+Normal rank
@@ Property / cites work @@
+A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum 3-connectivity augmentation of a graph
@@ Property / cites work: A minimum 3-connectivity augmentation of a graph / rank @@
+Normal rank