Solving shortest paths efficiently on nearly acyclic directed graphs (2007)

by S Saunders, T Takaoka
Venue:Theoretical Computer Science