Abstract:In this paper, we study the complexity of two types of digraph packing problems: perfect out-forests problem and Steiner cycle packing problem.For the perfect out-forest problem, we prove that it is NP-hard to decide whether a given strong digraph contains a 1-perfect outforest. However, when restricted to a semicomplete digraph D, the problem of deciding whether D contains an i-perfect out-forest becomes polynomial-time solvable, where i ∈ {0, 1}. We also prove that it is NP-hard to find a 0-perfect out-fores… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.