On Complexity of Minimum Leaf Out-branching Problem

Peter Dankelmann, Gregory Gutin, Eun Jung Kim

Given a digraph $D$, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in $D$ an out-branching with the minimum possible number of leaves, i.e., vertices of…