On Finding Directed Trees with Many Leaves (Q3656853): Difference between revisions

@@ Property / arXiv ID @@
+.2658
@@ Property / arXiv ID: 0904.2658 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms 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 @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+Self-stabilizing systems in spite of distributed control
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves
@@ Property / cites work: Spanning trees with many leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum leaf spanning arborescence problem
+Normal rank
@@ Property / cites work @@
+Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
+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 @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Finding Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Q5596083
@@ Property / cites work: Q5596083 / rank @@
+Normal rank
@@ Property / cites work @@
+Rubber bands, convex embeddings and graph connectivity
+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 / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank