Efficient Algorithms for Shortest Paths in Sparse Networks

  title={Efficient Algorithms for Shortest Paths in Sparse Networks},
  author={Donald B. Johnson},
  journal={Journal of the ACM (JACM)},
  pages={1 - 13}
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs. Known results which the results of this paper extend are surveyed briefly and analyzed. A new implementation for priority queues is employed, and a class of “arc set partition” algorithms is introduced. For the single source problem on networks with nonnegative arcs a running time of O(min(n1+1/k + e, n + e) log n)) is achieved, where there are n… 
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
Optimally fast shortest path algorithms for some classes of graphs
Two algorithms for shortest path problems are presented. One is to find the all-pairs shortest paths (APSP) that runs in O(n 2logn + nm) time for n-vertex m-edge directed graphs consisting of
An efficient algorithm for K shortest simple paths
This article gives an efficient algorithm for obtaining K shortest simple paths between two specified nodes in an undirected graph G with non-negative edge lengths, which is better than those realized by existing algorithms.
A Novel Linear Algorithm for Shortest Paths in Networks
The proposed algorithm is efficient for all classes of networks and extremely efficient for networks with small C, and the decision which classes of Networks are most suitable for the proposed approach can be made based on simple parameters.
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
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.
Scaling algorithms for network problems
  • H. Gabow
  • Computer Science
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
This work presents efficient algorithms for network problems that work by scaling the numeric parameters, and gives simple algorithms that match the best time bounds for shortest paths on a directed graph with nonnegative lengths and maximum value network flow.
Improved shortest path algorithms for nearly acyclic graphs
Faster algorithms for shortest path and network flow based on graph decomposition
We propose faster algorithms for the maximum flow problem and shortest path problems based on graph decomposition. Our algorithms first construct indices (data structures) from a given graph, then
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Dijkstra’s algorithm for the single source single target shortest paths problem in large sparse graphs is considered to reduce the response time for online queries by using precomputed information.
Finding k Simple Shortest Paths and Cycles
This work gives hardness results for sparse graphs, relative to the complexity of computing a minimum weight cycle in a graph, for several variants of problems related to finding $k$ simple paths and cycles.


Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons
A (computer programming) algorithm is presented which is based on Dijkstra 's principle for finding the lengths of all shortest paths from either a fixed node or from all nodes in N-node
A Shortest Path Algorithm for Edge-Sparse Graphs
An algorithm (FLOW) for finding the shortest distance from a given node S to each node X of a directed graph with nonnegative integer arc lengths less than or equal to WM is presented. FLOW is
Shortcut in the decomposition algorithm for shortest paths in a network
A decomposition algorithm is proposed for use for use in finding the shortest path between the two nodes of every pair in a large n-node network, which requires less computer storage and fewer arithmetic operations than other known algorithms.
An algorithm for finding shortest routes from all source nodes to a given destination in general networks
This paper presents an algorithm for finding all shortest routes from all nodes to a given destination in iV-node general networks (in which the distances of arcs can be negative). If no negative
On the Shortest Route Through a Network
This paper refines proposals to give what is believed to be the shortest procedure for finding the shortest route when it is little effort to arrange distances in increasing order by nodes or to skip consideration of arcs into nodes whose shortest route to the origin has been determined earlier in the computation.
On shortest paths and sorting
It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm, and bounds on the largest possible amount of work are established.
Abstract : A shortest route is sought between a fixed origin to other nodes in a graph when directed arc distances are given which may be positive, negative, or zero. This problem as stated includes
A Note on Dijkstra's Shortest Path Algorithm
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O(n)(supscrpt) steps is disproved by showing a set of networks which take O (O) 2 (n) 3 steps.
Abstract : An inductive procedure on nodes is given that requires n(n-1)(n-2) comparison - addition operations to determine minimum routes between all nodes of a directed network. Arc distances may
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Upper bounds on the number of steps in these algorithms are derived, and are shown to improve on the upper bounds of earlier algorithms.