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

Elias Dahlhaus. Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG 92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Volume 657 of Lecture Notes in Computer Science, pages 60-69, Springer, 1992.

Abstract

Abstract is missing.