Safe Sequences via Dominators in DAGs for Path-Covering Problems

Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu

A path-covering problem on a directed acyclic graph (DAG) requires finding a set of source-to-sink paths that cover all the nodes, all the arcs, or subsets thereof, and additionall…