What features really make distributed minimum spanning tree algorithms efficient?

Michalis Faloutsos, Mart Molle. What features really make distributed minimum spanning tree algorithms efficient?. In 1996 International Conference on Parallel and Distributed Systems (ICPADS 96), June 3-6, 1996, Tokyo, Japan, Proceedings. pages 106, IEEE Computer Society, 1996. [doi]

Abstract

Abstract is missing.