Alon, Noga ; Fomin, Fedor V. ; Gutin, Gregory ; Krivelevich, Michael ; Saurabh, Saket (2009) Spanning Directed Trees with Many Leaves SIAM Journal on Discrete Mathematics, 23 (1). pp. 466-476. ISSN 0895-4801
Full text not available from this repository.
Official URL: http://doi.org/10.1137/070710494
Related URL: http://dx.doi.org/10.1137/070710494
Abstract
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |
| ID Code: | 123476 |
| Deposited On: | 20 Sep 2021 10:51 |
| Last Modified: | 20 Sep 2021 10:51 |
Repository Staff Only: item control page
