Shortest Path Algorithms for Nearly Acyclic Directed Graphs (1996)

by Tadao Takaoka
Venue:In Workshop on Graph-Theoretic Concepts in Computer Science