A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger. A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. In Branislav Rovan, Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. Volume 2747 of Lecture Notes in Computer Science, pages 259-268, Springer, 2003. [doi]

Abstract

Abstract is missing.