Abstract
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.
Part of the work has been done while the author was still at the Computer Science Department of the University of Bonn
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Bandelt, H. Mulder, Distance hereditary Graphs, Journal of Combinatorial Theory Ser. B vol. 41 (1986), pp. 182–208.
R. Cole, U. Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms, Proceedings of the 18-th Annual ACM Symposium on Theory of Computing (1986), pp. 206–219.
D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progression, Proceedings of the 19-th Annual ACM Symposium on Theory of Computing (1987), pp. 1–6.
E. Dahlhaus, Chordale Graphen im besonderen Hinblick auf parallele Algorithmen, Habilitation thesis.
E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, submitted.
E. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik 1 (1959), pp. 269–271.
M. Farber, Characterizations of Strongly Chordal Graphs, Discrete Mathematics 43 (1983), S. 173–189.
S. Fortune, J. Wyllie, Parallelism in Random Access Machines, 10. Annual Symposium on Theory of Computing (1978), pp. 114–118.
D. Fulkerson, O. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics 15 (1965), pp. 835–855.
F. Gavril, A Recognition Algorithm for the Intersection Graph of Paths in Trees, Discrete Mathematics 23 (1978), S. 211–227.
A. Gibbons, W. Rytter, ” Efficient Parallel Algorithms”, Cambridge University Press, Cambridge, 1989.
J. Gilbert, H. Hafsteinsson, Parallel Solution of Sparse Linear Systems, SWAT 88 (1988), LNCS 318, S. 145–153.
P. Hammer, F. Maffray, Completely Separable Graphs, Discrete Applied Mathematics 27 (1990), pp. 85–99.
P. Klein, Efficient Parallel Algorithms for Chordal Graphs, 29. IEEE-Symposium on Foundations of Computer Science (1988), pp. 150–161.
A. Lubiw, Doubly Lexical Orderings of Matrices, SIAM Journal on Computing 16 (1987), S. 854–879.
Tze-Heng Ma, J. Spinrad, Avoiding matrix multiplication, ”Graph Theoretic Concepts in Computer Science” (R. Möhring ed.), LNCS 484 (1990), pp. 61–71.
G. Miller, J. Reif, Parallel Tree Contraction and its Application, 26. IEEE-Symposium on Foundations of Computer Science (1985), S. 478–489.
F. Romani, Shortest-path-problem is not harder than matrix multiplication, Information Processing Letters 11 (1980), pp. 134–136.
B. Schieber, U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM Journal on Computing 17 (1988), pp. 1253–1262.
J. Spinrad, Doubly lexicalic ordering in dense 0–1 matrices, to appear.
J. Spinrad, On comparability and permutation graphs, SIAM Journal on Computing 14 (1985), pp. 658–670.
R. Tarjan, U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, SIAM Journal on Computing 14 (1985), pp. 862–874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dahlhaus, E. (1993). Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive