On Finding Directed Trees with Many Leaves


The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at least $k$ leaves. We use the notion of $s-t$ numbering to exhibit combinatorial bounds on the existence of spanning… (More)
DOI: 10.1007/978-3-642-11269-0_7


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics