most citedOn Complexity of Minimum Leaf Out-branching Problem

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2008★ 2 cited

On Complexity of Minimum Leaf Out-branching Problem

Peter Dankelmann, Gregory Gutin, Eun Jung Kim

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