@inproceedings{51fcd3a0dccd4690b2afcfee6d2d5d19,
title = "Parameterized algorithms for directed maximum leaf problems",
abstract = "We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family ℒ that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in ℒ. Our algorithms are based on the following combinatorial result which can be viewed as a generalization of many results for a 'spanning tree with many leaves' in the undirected case, and which is interesting on its own: If a digraph D ∈ ℒ of order n with minimum in-degree at least 3 contains a rooted spanning tree, then D contains one with at least (n/2)1/5 - 1 leaves.",
author = "Noga Alon and Fomin, {Fedor V.} and Gregory Gutin and Michael Krivelevich and Saket Saurabh",
year = "2007",
doi = "10.1007/978-3-540-73420-8_32",
language = "אנגלית",
isbn = "3540734198",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "352--362",
booktitle = "Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings",
note = "null ; Conference date: 09-07-2007 Through 13-07-2007",
}