Skip to main content
Conference Proceedings

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) (1993) 657 LNCS 60-69
DOI: 10.1007/3-540-56402-0_36
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Dahlhaus, E. (1993). Optimal (parallel) vertices distance algorithms for the all-to-all problem for certain graph classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 657 LNCS, pp. 60–69). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free