Sciweavers

CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 4 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 ...
FSTTCS
2007
Springer
13 years 10 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 ...