2-vertex connectivity in directed graphs (Q1640998): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3043435921
@@ Property / OpenAlex ID: W3043435921 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6277
@@ Property / arXiv ID: 1409.6277 / rank @@
+Normal rank
@@ 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 @@
+Finding dominators via disjoint set union
@@ Property / cites work: Finding dominators via disjoint set union / rank @@
+Normal rank
@@ Property / cites work @@
+The Minset-Poset Approach to Representations of Graph Connectivity
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+-Edge Connectivity in Directed Graphs
@@ Property / cites work: 2-Edge Connectivity in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominator Tree Certification and Divergent Spanning Trees
+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 @@
+On computing the 2-vertex-connected components of directed graphs
+Normal rank
@@ Property / cites work @@
+A fast algorithm for finding dominators in a flowgraph
+Normal rank
@@ Property / cites work @@
+-Connectivity in Directed Graphs: An Experimental Study
+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 @@
+Finding Dominators in Directed Graphs
@@ Property / cites work: Finding Dominators in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Maintaining bridge-connected and biconnected components on-line
+Normal rank