Optimal (parallel) vertices distance algorithms for the all-to-all problem for certain graph classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 657 LNCS, Issue , 1993, Pages 60-69

  Dahlhaus, Elias ^a,b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

DISTANCE ALGORITHM; DISTANCE-HEREDITARY GRAPHS; GRAPH CLASS; LOGARITHMIC TIME; PATH GRAPHS; PERMUTATION GRAPH; STRONGLY CHORDAL GRAPH; TIME ALGORITHMS;

GRAPH THEORY;

EID: 85029582236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56402-0_36     Document Type: Conference Paper

References (22)

1. H. Bandelt, H. Mulder, Distance hereditary Graphs, Journal of Combinatorial Theory Set. Bvol. 41 (1986), pp. 182-208.
2. R. Cole, U. Vishkln, 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.
3. 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.
4. E. Dahlhaus, Chordale Graphen in besonderen Hinblick auf parallele Algorithmen, Habilitation thesis.
5. E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, submitted.
6. E. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik 1 (1959), pp. 269-271.
7. M. Faxber, Characterizations of Strongly Chordal Graphs, Discrete Mathematic 8 43 (1983), S. 173-189.
8. S. Fortune, :I. Wyllie, Parallelism in Random Access Machines, 10. Annual Symposium on Theory of Computing (1978), pp. 114-118.
9. D. Fulkerson, O. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematic 8 15 (1965), pp. 835-855.
10. F. Gavril, A Recognition Algorithm for the Intersection Graph of Paths in Trees, Discrete Mathematica 23 (1978), S. 211-227.
11. A. Gibbons, W. Rytter, “Efficient Parallel Algorithms”, Cambridge University Press, Cambridge, 1989.
12. J. Gilbert, H. Hafsteinsson, Parallel Solution of Sparse Linear Systems, SWAT 88 (1988), LNCS 318, S. 145-153.
13. P. Hammer, F. Maffray, Completely Separable Graphs, Discrete Applied Mathematics 27 (1990), pp. 85-99.
14. P. Klein, Efficient Parallel Algorithms for Chordal Graphs, 29. IEEE-Symposium on Foundations of Computer Science (1988), pp. 150-161.
15. A. Lubiw, Doubly Lexical Orderlngs of Matrices, SIAM Journal on Computing 16 (1987), S. 854-879.
16. Tze-Heng Ma, J. Spixtrad, Avoiding matrix multiplication, “Graph Theoretic Concepts in Computer Science” (R. Möhring ed.), LNCS 484 (1990), pp. 61-71.
17. G. Miller, J. Reif, Parallel Tree Contraction and its Application, 26. IEEE-Symposium on Foundations of Computer Science (1985), S. 478-489.
18. F. Romani, Shortest-path-problem is not harder than matrix multiplication, Information Processing Letter 11 (1980), pp. 134-136.
19. B. Schieber, U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM Journal on Computing 17 (1988), pp. 1253-1262.
20. J. Spirlrad, Doubly lexicalic ordering in dense 0-1 matrices, to appear.
21. J. Spinrad, On comparability and permutation graphs, SIAM Journal on Computing 14 (1985), pp. 658-670.
22. R. Tarjan, U. Vislddn, Finding biconnected components and computing tree functions in logarithmic parallel time, SIAM Journal on Computing 14 (1985), pp. 862-874.