Strong articulation points and strong bridges in large scale graphs (Q270023): Difference between revisions

@@ Property / Wikidata QID @@
+Q61609291
@@ Property / Wikidata QID: Q61609291 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SNAP
@@ Property / describes a project that uses: SNAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+WebGraph
@@ Property / describes a project that uses: WebGraph / 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.1007/s00453-015-9991-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2023856768
@@ Property / OpenAlex ID: W2023856768 / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors in Trees
@@ Property / cites work: On Finding Lowest Common Ancestors in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators in Linear Time
@@ Property / cites work: Dominators in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+The tree Constraint
@@ Property / cites work: The tree Constraint / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
+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 @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+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 @@
+Restricted arc-connectivity of digraphs
@@ Property / cites work: Restricted arc-connectivity of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501349
@@ Property / cites work: Q5501349 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921698
@@ Property / cites work: Q2921698 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators, Directed Bipolar Orders, and Independent Spanning Trees
+Normal rank
@@ Property / cites work @@
+Finding Dominators in Practice
@@ Property / cites work: Finding Dominators in Practice / rank @@
+Normal rank
@@ Property / cites work @@
+Finding strong bridges and strong articulation points in linear time
+Normal rank
@@ Property / cites work @@
+A fast algorithm for finding dominators in a flowgraph
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and depth-first search
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / DBLP publication ID @@
+journals/algorithmica/FirmaniGILS16
@@ Property / DBLP publication ID: journals/algorithmica/FirmaniGILS16 / rank @@
+Normal rank