![]() |
| 2007 | ||
|---|---|---|
| 4 | EE | Shane Saunders, Tadao Takaoka: Solving shortest paths efficiently on nearly acyclic directed graphs. Theor. Comput. Sci. 370(1-3): 94-109 (2007) |
| 2005 | ||
| 3 | EE | Shane Saunders, Tadao Takaoka: Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. CATS 2005: 127-131 |
| 2003 | ||
| 2 | Shane Saunders, Tadao Takaoka: Improved shortest path algorithms for nearly acyclic graphs. Theor. Comput. Sci. 293(3): 535-556 (2003) | |
| 2001 | ||
| 1 | EE | Shane Saunders, Tadao Takaoka: Improved Shortest Path Algorithms for Nearly Acyclic Graphs. Electr. Notes Theor. Comput. Sci. 42: (2001) |
| 1 | Tadao Takaoka | [1] [2] [3] [4] |