Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Paul Bonsma, Frederic Dorn. Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Transactions on Algorithms, 7(4):44, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning TreePaul S. Bonsma, Frederic Dorn. esa 2008: 222-233 [doi] A Faster FPT Algorithm for Finding Spanning Trees with Many LeavesPaul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger. mfcs 2003: 259-268 [doi]
The following publications are possibly variants of this publication: