Shane Saunders Tadao Takaoka Solving shortest paths efficiently on nearly acyclic directed graphs. 94-109 2007 370 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2006.10.008 db/journals/tcs/tcs370.html#SaundersT07