An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees

Francis Y. L. Chin, H. F. Ting. An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. In 26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA. pages 257-266, IEEE, 1985.

Abstract

Abstract is missing.