A good algorithm for edge-disjoint branching (Q1214942): Difference between revisions

@@ Property / author @@
-Robert Endre Tarjan
@@ Property / author: Robert Endre Tarjan / rank @@
-Normal rank
@@ Property / author @@
+Robert Endre Tarjan
@@ Property / author: Robert Endre Tarjan / 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/0020-0190(74)90024-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1965700310
@@ Property / OpenAlex ID: W1965700310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4132011
@@ Property / cites work: Q4132011 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity in digraphs
@@ Property / cites work: Connectivity in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4196458
@@ Property / cites work: Q4196458 / rank @@
+Normal rank