On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
<p dir="ltr">The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| منشور في: |
2025
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|