Shane Saunders

Improved shortest path algorithms for nearly acyclic graphs

Tadao Takaoka, Shane Saunders, 2003, Theor. Comput. Sci..

Solving shortest paths efficiently on nearly acyclic directed graphs

Tadao Takaoka, Shane Saunders, T. Takaoka, 2007, Theor. Comput. Sci..

Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs

Tadao Takaoka, Shane Saunders, 2005, CATS.

A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm

Shane Saunders, S. Saunders, 1999 .

Improved shortest path algorithms for nearly acyclic graphs

Tadao Takaoka, Shane Saunders, T. Takaoka, 2003, Theor. Comput. Sci..