Kernelization and complexity results for connectivity augmentation problems (Q3057175): Difference between revisions

@@ Property / cites work @@
+Experiments on data reduction for optimal domination in networks
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Cluster Editing: Evaluation and Experiments
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Augmentation
@@ Property / cites work: Approximation Algorithms for Graph Augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Vertex-Connectivity Network Design Problems
+Normal rank
@@ Property / cites work @@
+An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest Augmentations to Biconnect a Graph
@@ Property / cites work: Smallest Augmentations to Biconnect a Graph / rank @@
+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