On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Sign Up to like & getrecommendations! Published in 2025 at "Networks"
DOI: 10.1002/net.22290
Abstract: The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs… read more here.
Keywords: variant minimum; problem; minimum path; path cover ... See more keywords