Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs.

Lin Tian Tadao Takaoka Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. 15-24 2007 ACSC http://crpit.com/abstracts/CRPITV62Tian.html conf/acsc/2007 db/conf/acsc/acsc2007.html#TianT07