Shortest Path Algorithms for Nearly Acyclic Directed Graphs

Tadao Takaoka. Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Theoretical Computer Science, 203(1):143-150, 1998. [doi]

Abstract

Abstract is missing.