Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes

We present sequential O(n2) time algorithms and optimal logarithmic time algorithms to compute the all to all vertices distances in strongly chordal graphs, distance hereditary graphs, path graphs, and permutation graphs.

[1]  Peter L. Hammer,et al.  Completely separable graphs , 1990, Discret. Appl. Math..

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

[3]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory B.

[4]  Anna Lubiw,et al.  Doubly Lexical Orderings of Matrices , 1987, SIAM J. Comput..

[5]  Philip N. Klein,et al.  Efficient parallel algorithms for chordal graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[6]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[7]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[8]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[9]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[10]  Francesco Romani,et al.  Shortest-Path Problem is not Harder Than Matrix Multiplication , 1980, Inf. Process. Lett..

[11]  Jeremy P. Spinrad,et al.  Avoiding Matrix Multiplication , 1990, WG.

[12]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[13]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[14]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..

[15]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[16]  John R. Gilbert,et al.  Parallel Solution of Space Linear Systems , 1988, SWAT.

[17]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[18]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[19]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).