FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2009.06.005
@@ Property / DOI: 10.1016/j.jcss.2009.06.005 / 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.jcss.2009.06.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2138156539
@@ Property / OpenAlex ID: W2138156539 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Directed Maximum Leaf Problems
+Normal rank
@@ Property / cites work @@
+Better Algorithms and Bounds for Directed Maximum Leaf Problems
+Normal rank
@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4208001
@@ Property / cites work: Q4208001 / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+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
@@ Property / cites work: Spanning trees with many leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / 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 @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+On the approximability of some Maximum Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+Spanning trees in graphs of minimum degree 4 or 5
@@ Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / 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 @@
+A New Algorithm for Finding Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2009.06.005
@@ Property / DOI: 10.1016/J.JCSS.2009.06.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:847265