Skip to main navigation Skip to search Skip to main content

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

  • University of Fribourg

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method'. Together they form a unique fingerprint.
Sort by

Keyphrases

Computer Science

Mathematics