@inproceedings{a232bcabc57b44beb0c9ae97b96a1333,

title = "A faster FPT algorithm for max-leaf spanning trees",

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.49 k ). This is the fastest currently known algorithm for this problem.",

author = "P.S. Bonsma and T. Br{\"u}ggemann and G.J. Woeginger",

year = "2003",

doi = "10.1007/978-3-540-45138-9_20",

language = "English",

isbn = "3-540-40671-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "259--268",

editor = "B. Rovan and P. Vojt{\'a}s",

booktitle = "Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'2003, Bratislava, Slovakia, August 25-29, 2003)",

address = "Germany",

}