Abstract
We describe a new, fast, and fairly simple FPT algorithm for the problem of deciding whether a given input graph G has a spanning tree with at least k leaves. The time complexity of our algorithm is polynomially bounded in the size of G, and its dependence on k is roughly O(9.49k). This is the fastest currently known algorithm for this problem. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Bonsma, P. S., Brueggemann, T., & Woeginger, G. J. (2003). A faster FPT algorithm for finding spanning trees with many leaves. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 259–268. https://doi.org/10.1007/978-3-540-45138-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
