Sciweavers

Share
15 search results - page 1 / 3
» Minimum Leaf Out-Branching Problems
Sort
View
AAIM
2008
Springer
96views Algorithms» more  AAIM 2008»
8 years 9 months ago
Minimum Leaf Out-Branching Problems
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
Gregory Gutin, Igor Razgon, Eun Jung Kim
FSTTCS
2007
Springer
8 years 9 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
CORR
2008
Springer
115views Education» more  CORR 2008»
8 years 3 months ago
Spanning directed trees with many leaves
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
CORR
2008
Springer
108views Education» more  CORR 2008»
8 years 3 months ago
On Complexity of Minimum Leaf Out-branching Problem
Peter Dankelmann, Gregory Gutin, Eun Jung Kim
ICALP
2007
Springer
8 years 9 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
books