An exact algorithm for the maximum leaf spanning tree problem (Q653320): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.07.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2180968341
@@ Property / OpenAlex ID: W2180968341 / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+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 @@
+Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472448
@@ Property / cites work: Q4472448 / rank @@
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler and better approximation algorithms for network design
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Finding Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank