Skip to main content
SpringerLink
Log in

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present parallel algorithms for computing all pair shortest paths in directed graphs. Our algorithm has time complexityO(f(n)/p+I(n)logn) on the PRAM usingp processors, whereI(n) is logn on the EREW PRAM, log logn on the CCRW PRAM,f(n) iso(n 3). On the randomized CRCW PRAM we are able to achieve time complexityO(n 3/p+logn) usingp processors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [AGM] N. Alon, Z. Galil, and O. Margalit. On the exponent of all pairs shortest path problem.Proc. 32nd Ann. IEEE Symp. FOCS, pp. 569–575, 1991.

  • [DNS] E. Dekel, D. Nassimi, and S. Sahni. Parallel matrix and graph algorithms.SIAM J. Comput. 10:657–675, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  • [DS] E. Dekel and S. Sahni. Binary trees and parallel scheduling algorithms.IEEE Trans. Comput. 32:307–315, 1983.

    MATH  Google Scholar 

  • [D] E. W. Dijkstra. A note on two problems in connextion with graphs.Numer. Math. 1:269–271, 1959.

    Article  MATH  MathSciNet  Google Scholar 

  • [Fl] R. N. Floyd. Algorithm 97, Shortest path.Comm. ACM 5:345, 1962.

    Article  Google Scholar 

  • [Fr] M. L. Fredman. New bounds on the complexity of the shortest path problem.SIAM J. Comput. 5(1):83–89, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  • [GM] H. Gazit and G. L. Miller. An improved parallel algorithm that computes the BFS numbering of a directed graph.Inform. Process. Lett. 28(1):61–65, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  • [J] D. B. Johnson. Efficient algorithms for shortest paths in sparse networks.J. Assoc. Comput. Mach. 24(1):1–13, 1977.

    MATH  MathSciNet  Google Scholar 

  • [KR] M. Karp and V. Ramachandran. A survey of parallel algorithms for shared memory machines.Handbook of Theoretical Computer Science, pp. 869–941. North-Holland, Amsterdam, 1990.

    Google Scholar 

  • [L] A. Lingas. Efficient parallel algorithms for path problems in planar directed graphs.Proc. SIGAL '90, pp. 447–457. Lecture Notes in Computer Science, vol. 450. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  • [PK] R. C. Paige and C. P. Kruskal. Parallel algorithms for shortest path problems.Proc. Internat. Conf. on Parallel Processing, St. Charles, Illinois, pp. 14–19, 1985.

  • [PP1] V. Y. Pan and F. P. Preparata. Supereffective slow-down of parallel algorithms.Proc. ACM Symp. on Parallel Algorithms and Architectures, San Diego, California, pp. 402–409, 1992.

  • [PP2] V. Y. Pan and F. P. Preparata. Work-preserving speed-up of parallel matrix computations.SIAM J. Comput. 24(4):811–821, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  • [PR1] V. Y. Pan and J. H. Reif. Fast and efficient solution of path algebra problems.J. Comput. System Sci. 38(3):494–510, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • [PR2] V. Y. Pan and J. H. Reif. The parallel computation of minimum cost paths in graphs by stream contraction.Inform. Process. Lett. 40:79–83, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  • [R] R. Reischuk. Probabilistic parallel algorithms for sorting and selection.SIAM J. Comput. 14(2):396–409, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  • [S] R. Seidel. On the all-pair-shortest-path problem.Proc. 24th ACM STOC, pp. 745–749, 1992.

  • [T] T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem.Inform. Process. Lett. 43:195–199, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  • [V] L. G. Valiant. Parallelism in comparison problems.SIAM J. Comput. 4(3):348–355, 1975.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Yijie Han

    Present address: Electronic Data Systems, Inc., 300 E. Big Beaver Road, Mail Stop 408, 48083, Troy, MI, USA

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA

    Yijie Han

  2. Department of Mathematics and Computer Science, Lehman College, CUNY, 10468, Bronx, NY, USA

    V. Y. Pan

  3. Department of Computer Science, Duke University, 27706, Durham, NC, USA

    J. H. Reif

Authors
  1. Yijie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Y. Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. H. Reif
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by F.T. Leighton.

A preliminary version of this paper was presented at the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1992.

Support by NSF Grant CCR 90-20690 and PSC CUNY Awards #661340 and #662478.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, Y., Pan, V.Y. & Reif, J.H. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Algorithmica 17, 399–415 (1997). https://doi.org/10.1007/BF02523680

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02523680

Key Words

Search

Navigation