Single-Source Shortest Paths

[1]  Andrew V. Goldberg,et al.  Shortest Path Algorithms: Engineering Aspects , 2001, ISAAC.

[2]  Mikkel Thorup,et al.  Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  Seth Pettie,et al.  On the Comparison-Addition Complexity of All-Pairs Shortest Paths , 2002, ISAAC.

[6]  Andrew V. Goldberg,et al.  Scaling algorithms for the shortest paths problem , 1995, SODA '93.

[7]  Peter Sanders,et al.  Computing Many-to-Many Shortest Paths Using Highway Hierarchies , 2007, ALENEX.

[8]  Mikkel Thorup,et al.  Quick and good facility location , 2003, SODA '03.

[9]  Seth Pettie,et al.  Experimental Evaluation of a New Shortest Path Algorithm , 2002, ALENEX.

[10]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[11]  Mikkel Thorup.  Floats, Integers, and Single Source Shortest Paths , 2000, J. Algorithms.

[12]  Seth Pettie,et al.  A new approach to all-pairs shortest paths on real-weighted graphs , 2004, Theor. Comput. Sci..

[13]  Torben Hagerup,et al.  Improved Shortest Paths on the Word RAM , 2000, ICALP.

[14]  Peter Sanders,et al.  Engineering highway hierarchies , 2006, JEAL.

[15]  H. Imai,et al.  PRACTICAL EFFICIENCY OF THE LINEAR-TIME ALGORITHM FOR THE SINGLE SOURCE SHORTEST PATH PROBLEM , 2000 .

[16]  Seth Pettie,et al.  A Shortest Path Algorithm for Real-Weighted Undirected Graphs , 2005, SIAM J. Comput..