An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs

A cost optimal parallel algorithm is presented to find the all-pairs shortest paths on an unweighted interval graph which takes O(n/p + log n) time on an EREW PRAM, where np and n represent respectively the number of processors and the number of vertices of the graph.

[1]  Raimund Seidel,et al.  On the all-pairs-shortest-path problem , 1992, STOC '92.

[2]  Paul G. Spirakis,et al.  Efficient Parallel Algorithms for Shortest Paths in Planar Graphs , 1990, SWAT.

[3]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Tadao Takaoka,et al.  A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem , 1991, Inf. Process. Lett..

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

[7]  Selim G. Akl,et al.  A Unified Approach to Parallel Depth-First Traversals of General Trees , 1991, Inf. Process. Lett..

[8]  C. P. Rangan,et al.  A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..

[9]  C. Pandu Rangan,et al.  An optimal algorithm to solve the all-pair shortest path problem on interval graphs , 1992, Networks.

[10]  Stephan Olariu,et al.  Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals , 1992, IEEE Trans. Parallel Distributed Syst..

[11]  Sajal K. Das,et al.  Breadth-First Traversal of Trees and Integer Sorting in Parallel , 1992, ICPP.

[12]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

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

[14]  Zvi Galil,et al.  All Pairs Shortest Distances for Graphs with Small Integer Length Edges , 1997, Inf. Comput..