The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Minimum Leaf Out-branching and Related Problems
[article]
2008
arXiv
pre-print
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 out-degree 0. We prove that MinLOB is polynomial-time solvable for acyclic digraphs. In general, MinLOB is NP-hard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every value of the parameter, but the third one is fixed-parameter tractable (FPT). The FPT parametrization is
arXiv:0801.1979v3
fatcat:owzbuxpjefakxe5lrjbql4u6iy