FPT algorithms and kernels for the Directed k-Leaf problem

Journal of Computer and System Sciences

Volumn 76, Issue 2, 2010, Pages 144-152

  Daligault, Jean ^a   Gutin, Gregory ^b   Kim, Eun Jung ^b   Yeo, Anders ^b  

^a UNIV MONTPELLIER   (France)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Fixed parameter tractable; Kernel; Leaves; Out branching

Indexed keywords

COMPUTER NETWORKS; SYSTEMS SCIENCE;

ACYCLIC DIGRAPH; FIXED-PARAMETER TRACTABLE; INTEGRAL PARAMETERS; KERNEL; LEAVES; ORIENTED SPANNING TREES; OUT-BRANCHING; TIME ALGORITHMS;

DIRECTED GRAPHS;

EID: 70450225255     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.06.005     Document Type: Article

References (25)

1. Alon N., Fomin F.V., Gutin G., Krivelevich M., and Saurabh S. Parameterized algorithms for directed maximum leaf problems. Proc. 34th ICALP. Lecture Notes in Comput. Sci. vol. 4596 (2007) 352-362
2. Alon N., Fomin F.V., Gutin G., Krivelevich M., and Saurabh S. Better algorithms and bounds for directed maximum leaf problems. Proc. 27th Conf. Foundations Software Technology and Theoretical Computer Science. Lecture Notes in Comput. Sci. vol. 4855 (2007) 316-327
3. Alon N., Fomin F.V., Gutin G., Krivelevich M., and Saurabh S. Spanning directed trees with many leaves. SIAM J. Discrete Math. 23 (2009) 466-476
4. Asratian A.S., Denley T.M.J., and Häggkvist R. Bipartite Graphs and Their Applications (1998), Cambridge Univ. Press, Cambridge
5. Bang-Jensen J., and Gutin G. Digraphs: Theory, Algorithms and Applications (2000), Springer, London
6. Bodlaender H.L., Downey R.G., Fellows M.R., and Hermelin D. On problems without polynomial kernels. Lecture Notes in Comput. Sci. vol. 5125 (2008) 563-574
7. Bonsma P.S., Brueggermann T., and Woeginger G.J. A faster FPT algorithm for finding spanning trees with many leaves. Lecture Notes in Comput. Sci. vol. 2747 (2003) 259-268
8. Bonsma P.S., and Dorn F. An FPT algorithm for directed spanning k-leaf. Tech. Report (2007). http://arxiv.org/abs/0711.4052
9. Bonsma P.S., and Dorn F. Tight bounds and faster algorithms for directed max-leaf. Proc. 16th ESA. Lecture Notes in Comput. Sci. vol. 5193 (2008) 222-233
10. Ding G., Johnson Th., and Seymour P. Spanning trees with many leaves. J. Graph Theory 37 (2001) 189-197
11. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
12. M. Drescher, A. Vetta, An approximation algorithm for the maximum leaf spanning arborescence problem, ACM Trans. Algorithms, in press
13. Estivill-Castro V., Fellows M.R., Langston M.A., and Rosamond F.A. FPT is P-time extremal structure I. Proc. ACiD'05 (2005), College Publications, London 1-41
14. Fellows M.R., McCartin C., Rosamond F.A., and Stege U. Coordinated kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. Lecture Notes in Comput. Sci. vol. 1974 (2000) 240-251
15. Fernau H., Fomin F.V., Lokshtanov D., Raible D., Saurabh S., and Villanger Y. Kernel(s) for problems with no kernel: On out-trees with many leaves. Tech. Report (2008). http://arxiv.org/abs/0810.4796v2
16. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
17. n. Algorithmica 52 (2008) 153-166
18. Galbiati G., Morzenti A., and Maffioli F. On the approximability of some maximum spanning tree problems. Theoret. Comput. Sci. 181 (1997) 107-118
19. Griggs J.R., and Wu M. Spanning trees in graphs of minimum degree four or five. Discrete Math. 104 (1992) 167-183
20. Kleitman D.J., and West D.B. Spanning trees with many leaves. SIAM J. Discrete Math. 4 (1991) 99-106
21. Kneis J., Langer A., and Rossmanith P. A new algorithm for finding trees with many leaves. Proc. ISAAC 2008. Lecture Notes in Comput. Sci. vol. 5369 (2008) 270-281
22. N. Linial, D. Sturtevant, Unpublished result, 1987
23. Lu H.I., and Ravi R. Approximating maximum leaf spanning trees in almost linear time. J. Algorithms 29 (1998) 132-141
24. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
25. Solis-Oba R. 2-approximation algorithm for finding a spanning tree with the maximum number of leaves. Lecture Notes in Comput. Sci. vol. 1461 (1998) 441-452