The following publications are possibly variants of this publication:
- Shortest Path Algorithms for Nearly Acyclic Directed GraphsTadao Takaoka. criwg 1997: 367-374
- Shortest Path Algorithms for Nearly Acyclic Directed GraphsTadao Takaoka. TCS, 203(1):143-150, 1998. [doi]
- Improved shortest path algorithms for nearly acyclic graphsShane Saunders, Tadao Takaoka. TCS, 293(3):535-556, 2003.
- Improved Shortest Path Algorithms for Nearly Acyclic GraphsShane Saunders, Tadao Takaoka. TCS, 42:232-248, 2001. [doi]
- Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed GraphsShane Saunders, Tadao Takaoka. cats 2005: 127-131 [doi]
- Solving shortest paths efficiently on nearly acyclic directed graphsShane Saunders, Tadao Takaoka. TCS, 370(1-3):94-109, 2007. [doi]