Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems

Christoph Meinel, Stephan Waack. Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. In Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete, editors, LATIN 95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings. Volume 911 of Lecture Notes in Computer Science, pages 427-435, Springer, 1995.

Abstract

Abstract is missing.