On complexity of minimum leaf out-branching problem (Q967352): Difference between revisions

@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+Minimum Leaf Out-Branching Problems
@@ Property / cites work: Minimum Leaf Out-Branching Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934648
@@ Property / cites work: Q2934648 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph Decompositions and Monotonicity in Digraph Searching
+Normal rank
@@ Property / cites work @@
+On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
+Normal rank
@@ Property / cites work @@
+DAG-width
@@ Property / cites work: DAG-width / rank @@
+Normal rank