Covering pairs in directed acyclic graphs, Yuri Pirola, LATA 2014 (slides). The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexity of […]
Read More