Undirected single-source shortest paths with positive integer weights in linear time

@article{Thorup1999UndirectedSS,
  title={Undirected single-source shortest paths with positive integer weights in linear time},
  author={Mikkel Thorup},
  journal={J. ACM},
  year={1999},
  volume={46},
  pages={362-394}
}
  • M. Thorup
  • Published 1 May 1999
  • Computer Science
  • J. ACM
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… 
A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
TLDR
It is demonstrated that the proposed new single-source shortest path algorithm for nonnegative weight graph is faster than Dijkstra's algorithm using Fibonacci heap in average situation when n is large enough.
A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time
TLDR
On random graph, this algorithm has linear time complexity(in expect).
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
TLDR
A randomized algorithm for vertex-decremental SSSP with total expected update time O(n2+o(1)logL), that responds to each shortest-path query in Õ(nlogL) time in expectation, returning a (1+є)-approximate shortest path, that works against an adaptive adversary.
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
TLDR
This paper presents an algorithm for calculating shortest path for nonnegative weighted undirected graphs and completes its execution in O(|E|) for all targeted graphs---where no successor node updates predecessor node.
Directed single-source shortest-paths in linear average-case time
  • U. Meyer
  • Computer Science, Mathematics
  • 2001
TLDR
This paper gives simple label-setting and label-correcting algorithms for arbitrary directed graphs with random real edge weights uniformly distributed in [0; 1℄] and shows that they need linear timeO(n+m) with high probability.
Shortest Paths in Geometric Intersection Graphs
TLDR
This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks, and presents the first near-linear-time p1 ` εq-approximation algorithm for the diameter and for other related problems, such as the radius and the bichromatic closest pair.
Hybrid Bellman-Ford-Dijkstra algorithm
Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs
In this paper we present hybrid algorithms for the singlesource shortest paths (SSSP) and the all-pairs shortest paths (APSP) problems which are asymptotically fast when run on graphs with few
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
TLDR
The algorithm takes the hierarchy-based approach invented by Thorup, and, if the ratio between the maximum and minimum edge lengths is bounded by n(log n)O(1), it can solve the single-source problem in O(m + n log log n) time.
A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
TLDR
An algorithm for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirecting graphs and the algorithm completes its execution in O(E) for all graphs except few in which longer path from source to some node makes it best selection for that node.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
Faster shortest-path algorithms for planar graphs
TLDR
The shortest-path algorithm yields an $O(n^{4/3} \log n)$-time algorithm for finding a perfect matching in a planar bipartite graph and a similar improvement is obtained for maximum flow in a directed planar graph.
A scaling algorithm for weighted matching on general graphs
  • H. Gabow
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
TLDR
An algorithm for maximum matching on general graphs with integral edge weights, running in time O(n3/4m lg N), where n, m and N are the number of vertices, number of edges, and largest edge weight magnitude, respectively.
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
  • M. Fredman, D. Willard
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n/log log n) implementation of Dijkstra's shortest-path algorithm for a
Recent results on the single-source shortest paths problem
TLDR
This paper summarizes the currently best known theoretical results for the single-source shortest paths problem for directed graphs with non-negative edge weights and points out that a recent result leads to even better time bounds for this problem than claimed by the authors.
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
TLDR
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
A linear-time algorithm for a special case of disjoint set union
TLDR
A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance, which gives similar improvements in the efficiency of algorithms for solving a number of other problems.
On the shortest spanning subtree of a graph and the traveling salesman problem
7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J.
Sorting in linear time?
We show that a unit-cost RAM with a word length of bits can sort integers in the range in time, for arbitrary ! , a significant improvement over the bound of " # $ achieved by the fusion trees of
Faster algorithms for the shortest path problem
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network
Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space
  • P. Boas
  • Computer Science
    Inf. Process. Lett.
  • 1977
...
...