Finding strong bridges and strong articulation points in linear time (Q443716): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.11.011
@@ Property / DOI: 10.1016/j.tcs.2011.11.011 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2011379509
@@ Property / OpenAlex ID: W2011379509 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q61609439
@@ Property / Wikidata QID: Q61609439 / rank @@
+Normal rank
@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The tree Constraint
@@ Property / cites work: The tree Constraint / rank @@
+Normal rank
@@ Property / cites work @@
+Q4314299
@@ Property / cites work: Q4314299 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
+Normal rank
@@ Property / cites work @@
+Q4542546
@@ Property / cites work: Q4542546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Bijoin points, bibridges, and biblocks of directed graphs
+Normal rank
@@ Property / cites work @@
+On computing a conditional edge-connectivity of a graph
+Normal rank
@@ Property / cites work @@
+Q5616737
@@ Property / cites work: Q5616737 / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
+Normal rank
@@ Property / cites work @@
+Finding Strong Bridges and Strong Articulation Points in Linear Time
+Normal rank
@@ Property / cites work @@
+Matrices, Digraphs, and Determinants
@@ Property / cites work: Matrices, Digraphs, and Determinants / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient determination of the transitive closure of a directed graph
+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-disjoint spanning trees and depth-first search
+Normal rank
@@ Property / cites work @@
+Restricted arc-connectivity of digraphs
@@ Property / cites work: Restricted arc-connectivity of digraphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.11.011
@@ Property / DOI: 10.1016/J.TCS.2011.11.011 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:443716