Integer priority queues with decrease key in constant time and the single source shortest paths problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mikkel Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 149-158, ACM, 2003. [doi]

The following publications are possibly variants of this publication:

Integer priority queues with decrease key in constant time and the single source shortest paths problemMikkel Thorup. jcss, 69(3):330-353, 2004. [doi]

Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear TimeMikkel Thorup. JACM, 46(3):362-394, 1999. [doi]

Floats, Integers, and Single Source Shortest PathsMikkel Thorup. jal, 35(2):189-201, 2000.

Floats, Integers, and Single Source Shortest PathsMikkel Thorup. STACS 1998: 14-24

Undirected Single Source Shortest Path in Linear TimeMikkel Thorup. focs 1997: 12-21 [doi]

runs on WebDSL