Found 1 document(s)
Page 1 of 1
-
A path cover of a digraph is a collection of paths collectively containing the vertex set of the digraph. A path cover with minimum cardinality for a directed acyclic graph can be found in polynomial time [Fulkerson, AMS...