The complexity of finding arc-disjoint branching flows (Q298947): Difference between revisions

@@ Property / author @@
-Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / rank @@
-Normal rank
@@ Property / author @@
+Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / 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.dam.2015.10.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2181756921
@@ Property / OpenAlex ID: W2181756921 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+(Arc-)disjoint flows in networks
@@ Property / cites work: (Arc-)disjoint flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced branchings in digraphs
@@ Property / cites work: Balanced branchings in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Sur les arborescences dans un graphe oriente
@@ Property / cites work: Sur les arborescences dans un graphe oriente / rank @@
+Normal rank
@@ Property / cites work @@
+On the Directed Degree-Preserving Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+On two minimax theorems in graph
@@ Property / cites work: On two minimax theorems in graph / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid theory and its applications in electric network theory and in statics
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On covering intersecting set-systems by digraphs
@@ Property / cites work: On covering intersecting set-systems by digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
+Normal rank