Sciweavers

Share
CORR
2008
Springer

Spanning directed trees with many leaves

8 years 10 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 paper, we obtain two combinatorial results on the number of leaves in out-branchings. We show that
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
Comments (0)
books