Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089): Difference between revisions

@@ Property / cites work @@
+Better Algorithms and Bounds for Directed Maximum Leaf Problems
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Directed Maximum Leaf Problems
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves
@@ Property / cites work: Spanning trees with many leaves / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum leaf spanning arborescence problem
+Normal rank
@@ Property / cites work @@
+Q4472448
@@ Property / cites work: Q4472448 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Leaf Out-Branching Problems
@@ Property / cites work: Minimum Leaf Out-Branching Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank