Login / Signup
On the parameterized complexity of the Minimum Path Cover problem in DAGs.
Manuel Cáceres
Massimo Cairo
Brendan Mumey
Romeo Rizzi
Alexandru I. Tomescu
Published in:
CoRR (2020)
Keyphrases
</>
parameterized complexity
directed acyclic graph
minimum cost
shortest path
global constraints
fixed parameter tractable
belief networks
np hard
symmetry breaking