1 paper · 2 filters
Manuel Cáceres, Brendan Mumey, Santeri Toivonen +1
Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental problem with a myriad of applications, including reachability. Although it is known how to s…