Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820): Difference between revisions

@@ Property / cites work @@
+Dominators in Linear Time
@@ Property / cites work: Dominators in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
+Normal rank
@@ Property / cites work @@
+Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+-Vertex Connectivity in Directed Graphs
@@ Property / cites work: 2-Vertex Connectivity in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921698
@@ Property / cites work: Q2921698 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
+Normal rank
@@ Property / cites work @@
+Finding strong bridges and strong articulation points in linear time
+Normal rank
@@ Property / cites work @@
+Computing the 2-blocks of directed graphs
@@ Property / cites work: Computing the 2-blocks of directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Graph Connectivity
@@ Property / cites work: Algorithmic Aspects of Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and depth-first search
+Normal rank
@@ Property / cites work @@
+Q2768327
@@ Property / cites work: Q2768327 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
+Normal rank