Tellache, N. E., & Baldacci, R. (2025). On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method.
Chicago Style (17th ed.) CitationTellache, Nour ElHouda, and Roberto Baldacci. On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method. 2025.
MLA (9th ed.) CitationTellache, Nour ElHouda, and Roberto Baldacci. On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method. 2025.
Warning: These citations may not always be 100% accurate.