Tadao Takaoka Shortest Path Algorithms for Nearly Acyclic Directed Graphs. 143-150 1998 203 Theor. Comput. Sci. 1 db/journals/tcs/tcs203.html#Takaoka98 http://dx.doi.org/10.1016/S0304-3975(97)00292-2