Tight bounds and a fast FPT algorithm for directed max-leaf spanning tree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 222-233

  Bonsma, Paul ^a   Dorn, Frederic ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

FIXED-PARAMETER TRACTABLE ALGORITHMS; FPT ALGORITHMS; ROOTED TREES; SPANNING TREE; STRONGLY CONNECTED; SUBGRAPHS; TIGHT BOUND; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 57749188856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_19     Document Type: Conference Paper

References (15)

1. Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Better algorithms and bounds for directed maximum leaf problems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 316-327. Springer, Heidelberg (2007), Full version: http://arxiv.org/abs/0803.0701
2. Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Parameterized algorithms for directed maximum leaf problems. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 352-362. Springer, Heidelberg (2007)
3. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet. 11, 1-21 (1993)
4. Bonsma, P., Brüggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáš , P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259-268. Springer, Heidelberg (2003)
5. Bonsma, P., Dorn, F.: An FPT algorithm for directed spanning k-leaf (2007), http://arxiv.org/abs/0711.4052
6. Bonsma, P., Zickfeld, F.: Spanning trees with many leaves in graphs without diamonds and blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 531-543. Springer, Heidelberg (2008)
7. Demaine, E., Gutin, G., Marx, D., Stege, U.: 07281 Open problems - Structure theory and FPT algorithmics for graphs, digraphs and hypergraphs. In: Dagstuhl Seminar Proceedings 07281 (2007), http://drops.dagstuhl.de/opus/ volltexte/2007/1254
8. Ding, G., Johnson, T., Seymour, P.: Spanning trees with many leaves. J. Graph Theory 37, 189-197 (2001)
9. Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem (manuscript, 2007)
10. Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 240-251. Springer, Heidelberg (2000)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
12. Gutin, G., Razgon, I., Kim, E.J.: Minimum leaf out-branching problems. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 235-246. Springer, Heidelberg (2008)
13. Gutin, G., Yeo, A.: Some parameterized problems on digraphs. Comput. J. 51, 363-371 (2008)
14. Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discrete Math. 4, 99-106 (1991)
15. Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 441-452. Springer, Heidelberg (1998)