pith. sign in

On a variant of the minimum path cover problem in acyclic digraphs: Computational complexity results and exact method.Networks, 86(3):325–357

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

math.OC 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.