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

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
• Keywords: CORR 2008, Directed Maximum Leaf, Education, Rooted Oriented Spanning, Strongly Connected