4 citations · 4 across the 1 of their papers we have counts for
1 paper
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov +3
The {\sc k-Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) with at least k leaves in a given digraph. The problem has recently re…