An algorithm for finding all the<i>k</i>-components of a digraph (Q3806837): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207168808803645
+Normal rank
@@ Property / OpenAlex ID @@
+W2058454080
@@ Property / OpenAlex ID: W2058454080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the connectivities of graphs and digraphs
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Vertex Connectivity of Graphs
@@ Property / cites work: Finding the Vertex Connectivity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-terminal maximum flows in node-capacitated networks
+Normal rank
@@ Property / cites work @@
+k-Blocks and Ultrablocks in Graphs
@@ Property / cites work: k-Blocks and Ultrablocks in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bottlenecks and Edge Connectivity in Unsymmetrical Networks
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:3806837