16 citations · 57 across the 26 of their papers we have counts for
1 paper · 2 filters
Jesper Larsson Träff
We show that the following variation of the single-source shortest path problem is NP-complete. Let a weighted, directed, acyclic graph G=(V,E,w) with source and sink vertices $s…