Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Shane Saunders, Tadao Takaoka. Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. In Mike D. Atkinson, Frank K. H. A. Dehne, editors, Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005. Volume 41 of CRPIT, pages 127-131, Australian Computer Society, 2005. [doi]

This author has not been identified. Look up 'Shane Saunders' in GoogleThis author has not been identified. Look up 'Tadao Takaoka' in Google

runs on WebDSL