The single-source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a positively weighted graph G with a source vertex s, find the shortest path from s to all other vertices in the graph.Since 1959, all theoretical developments in SSSP for general directed and undirected graphs have been based on Dijkstra's algorithm, visiting the vertices in order of increasing distance from s. Thus, any implementation of Dijkstra's algorithm sorts the vertices according to their distances from s. However, we do not know how to sort in linear time. Here, a deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with positive integer weights. The algorithm avoids the sorting bottleneck by building a hierarchical bucketing structure, identifying vertex pairs that may be visited in any order.

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ravindra K. Ahuja , Kurt Mehlhorn , James Orlin , Robert E. Tarjan, Faster algorithms for the shortest path problem, Journal of the ACM (JACM), v.37 n.2, p.213-223, April 1990  [doi>10.1145/77600.77615]
	2	Susanne Albers , Torben Hagerup, Improved parallel integer sorting without concurrent writing, Information and Computation, v.136 n.1, p.25-51, July 10, 1997  [doi>10.1006/inco.1997.2632 ]
	3	Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman, Sorting in linear time?, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.427-436, May 29-June 01, 1995, Las Vegas, Nevada, United States  [doi>10.1145/225058.225173]
	4	Arne Andersson , Peter Bro Miltersen , Mikkel Thorup, Fusion trees can be implemented with AC0 instructions only, Theoretical Computer Science, v.215 n.1-2, p.337-344, Feb. 28, 1999  [doi>10.1016/S0304-3975(98)00172-8 ]
	5	Boris V. Cherkassky , Andrew V. Goldberg , Craig Silverstein, Buckets, heaps, lists, and monotone priority queues, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.83-92, January 05-07, 1997, New Orleans, Louisiana, United States
	6	DIJKSTRA, E. W. 1959. A note on two problems in connection with graphs. Numer. Math. 1, 269-271.
	7	DINIC, E.A. 1978. Finding shortest paths in a network. In Transportation Modeling Systems, Y. Popkov and B. Shmulyian, eds. Institute for System Studies, Moscow, CIS, pp. 36-44.
	8	Michael L. Fredman , Robert Endre Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM (JACM), v.34 n.3, p.596-615, July 1987  [doi>10.1145/28869.28874]
	9	Michael L. Fredman , Dan E. Willard, Surpassing the information theoretic bound with fusion trees, Journal of Computer and System Sciences, v.47 n.3, p.424-436, Dec. 1993  [doi>10.1016/0022-0000(93)90040-4]
	10	Michael L. Fredman , Dan E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, Journal of Computer and System Sciences, v.48 n.3, p.533-551, June 1994  [doi>10.1016/S0022-0000(05)80064-9]
	11	GABOW, H.N. 1985. A scaling algorithm for weighted matching on general graphs. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 90-100.
	12	GABOW, H. N. AND TARJAN, R.E. 1985. A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 209-221.
	13	Monika R. Henzinger , Philip Klein , Satish Rao , Sairam Subramanian, Faster shortest-path algorithms for planar graphs, Journal of Computer and System Sciences, v.55 n.1, p.3-23, Aug. 1997  [doi>10.1006/jcss.1997.1493 ]
	14	KRUSKAL, J. B. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48-50.
	15	K. Mehlhorn , S. Näher, Bounded ordered dictionaries in O(loglogN) time and O(n) space, Information Processing Letters, v.35 n.4, p.183-189, Aug. 1990  [doi>10.1016/0020-0190(90)90022-P ]
	16	Rajeev Raman, Priority Queues: Small, Monotone and Trans-dichotomous, Proceedings of the Fourth Annual European Symposium on Algorithms, p.121-137, September 25-27, 1996
	17	Rajeev Raman, Recent results on the single-source shortest paths problem, ACM SIGACT News, v.28 n.2, p.81-87, June 1997  [doi>10.1145/261342.261352]
	18	Robert Endre Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM (JACM), v.22 n.2, p.215-225, April 1975  [doi>10.1145/321879.321884]
	19	Mikkel Thorup, On RAM priority queues, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.59-67, January 28-30, 1996, Atlanta, Georgia, United States
	20	Mikkel Thorup, Floats, Integers, and Single Source Shortest Paths, Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, p.14-24, February 25-27, 1998
	21	VAN EMDE BOAS, P. 1977. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett. 6, 80-82.
	22	VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99-127.
	23	Dan E. Willard, Applications of the fusion tree method to computational geometry and searching, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.286-295, September 1992, Orlando, Florida, United States
	24	WILLIAMS, J. W.J. 1964. Heapsort. Commun. ACM 7, 6 (June), 347-348.

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski