Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
On linear time minor tests with depth-first search
Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.01 |
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n + 4)/3 for cubic graphs without the diamond K4 - e as a subgraph. We generalize the second result by proving that every graph with minimum degree at least 3, without diamonds and certain subgraphs called blossoms, has a spanning tree with at least (n + 4)/3 leaves. We show that it is necessary to exclude blossoms in order to obtain a bound of the form n/3 + c. We use the new bound to obtain a simple FPT algorithm, which decides in O(m)+O*(6.75k) time whether a graph of size m has a spanning tree with at least k leaves. This improves the best known time complexity for Max-Leaves Spanning Tree.