Edge-disjoint spanning trees and depth-first search (Q1217713): Difference between revisions

@@ Property / cites work @@
+Q4061956
@@ Property / cites work: Q4061956 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of LR(k) parsers
@@ Property / cites work: Optimization of LR(k) parsers / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Lehmans switching game and a theorem of Tutte and Nash-Williams
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid intersection algorithms
@@ Property / cites work: Matroid intersection algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Solution of the Shannon Switching Game
@@ Property / cites work: A Solution of the Shannon Switching Game / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+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 @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Finding Dominators in Directed Graphs
@@ Property / cites work: Finding Dominators in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing flow graph reducibility
@@ Property / cites work: Testing flow graph reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for finding weak components
@@ Property / cites work: A new algorithm for finding weak components / rank @@
+Normal rank
@@ Property / cites work @@
+A good algorithm for edge-disjoint branching
@@ Property / cites work: A good algorithm for edge-disjoint branching / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank