Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach

The all-pairs shortest path algorithms compute the shortest paths between all node pairs in a network. This paper presents a parallel algorithm for the all-pairs shortest path problem with a network decomposition approach. The algorithm decomposes the network into a set of independent augmented directed acyclic subnetworks that can be efficiently processed in parallel. The shortest path computation for each subnetwork provides a subset of the all-pairs shortest paths in the original network. The superiority of the new algorithm was verified through comparing its performance against that of the parallel single-origin shortest path algorithm. The execution times were compared for hypothetical and real-world networks with different sizes. A percentage of improvement in the execution time of about 50% was recorded for the transportation network of a large metropolitan area.

[1]  Haris N. Koutsopoulos,et al.  A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures , 1994, Transp. Sci..

[2]  Averill M. Law,et al.  A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths , 1978, Networks.

[3]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[4]  David E. Boyce,et al.  Implementing parallel shortest path for parallel transportation applications , 2001, Parallel Comput..

[5]  Michelle R. Hribar,et al.  Balancing load versus decreasing communication: exploring the tradeoffs , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[6]  Michael L. Fredman,et al.  New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[7]  Margaret O'Mahony,et al.  Parallel implementation of a transportation network model , 2005, J. Parallel Distributed Comput..

[8]  B. Carré.  An Algebra for Network Routing Problems , 1971 .

[9]  Sakti Pramanik,et al.  An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..

[10]  P. Varshney,et al.  Hierarchical path computation approach for large graphs , 2008, IEEE Transactions on Aerospace and Electronic Systems.

[11]  Hanan Samet,et al.  A Linear Iterative Approach for Hierarchical Shortest Path Finding , 2002 .

[12]  Greg N. Frederickson,et al.  Planar graph decomposition and all pairs shortest paths , 1991, JACM.

[13]  James Demmel,et al.  Minimizing Communication in All-Pairs Shortest Paths , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[14]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[15]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[16]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[17]  Philip N. Klein,et al.  A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs , 1998, Algorithmica.

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[20]  T. C. Hu,et al.  Tree decomposition algorithm for large networks , 1977, Networks.

[21]  Hani S. Mahmassani,et al.  Design and implementation of parallel time-dependent least time path algorithms for Intelligent Transportation Systems applications , 1997 .

[22]  Yves Tabourier,et al.  All shortest distances in a graph. An improvement to Dantzig's inductive algorithm , 1973, Discret. Math..

[23]  Xiao Fan Wang,et al.  Partitioning graphs to speed up point-to-point shortest path computations , 2011, IEEE Conference on Decision and Control and European Control Conference.

[24]  Edith Cohen.  Efficient parallel shortest-paths in digraphs with a separator decomposition , 1993, SPAA '93.

[25]  George B. Dantzig,et al.  ALL SHORTEST ROUTES IN A GRAPH , 1966 .

[26]  Michel Gendreau,et al.  Applications of parallel computing in transportation - introduction , 2001, Parallel Computing.

[27]  Xiao Fan Wang,et al.  Efficient Routing on Large Road Networks Using Hierarchical Communities , 2011, IEEE Transactions on Intelligent Transportation Systems.

[28]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[29]  Hani S. Mahmassani,et al.  An extension of labeling techniques for finding shortest path trees , 2009, Eur. J. Oper. Res..

[30]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[31]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[32]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.