Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844): Difference between revisions

@@ 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.1007/978-3-540-77050-3_26
+Normal rank
@@ Property / OpenAlex ID @@
+W1499339779
@@ Property / OpenAlex ID: W1499339779 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Directed Maximum Leaf Problems
+Normal rank
@@ Property / cites work @@
+Quickly excluding a forest
@@ Property / cites work: Quickly excluding a forest / 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 @@
+Q3972950
@@ Property / cites work: Q3972950 / 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 @@
+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 @@
+Solving Connected Dominating Set Faster Than 2 n
@@ Property / cites work: Solving Connected Dominating Set Faster Than 2 n / rank @@
+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 @@
+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 @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Interval graphs and searching
@@ Property / cites work: Interval graphs and searching / rank @@
+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