Efficient algorithms for solving shortest paths on nearly acyclic directed graphs
Year: 2005
Type: conference-paper
Authors: Shane Saunders, Tadao Takaoka
Institution: University of Canterbury
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1530999636
