My Master's thesis project: Faster solver for minimum-cost minimum path cover by using graph decomposition
-
Updated
May 22, 2017 - C++
My Master's thesis project: Faster solver for minimum-cost minimum path cover by using graph decomposition
Algorithm to find a Minimum Path Cover of an arbitary DAG in JS/TS.
Efficient C++ implementations of different fast algorithms for Minimum Path Cover
Add a description, image, and links to the minimum-path-cover topic page so that developers can more easily learn about it.
To associate your repository with the minimum-path-cover topic, visit your repo's landing page and select "manage topics."