IEEE - Institute of Electrical and Electronics Engineers, Inc. - What features really make distributed minimum spanning tree algorithms efficient?

Proceedings of 1996 International Conference on Parallel and Distributed Systems

Author(s): Faloutsos, M. ; Molle, M.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1996
Conference Location: Tokyo, Japan, Japan
Conference Date: 3 June 1996
Page(s): 106 - 114
ISBN (Paper): 0-8186-7267-6
DOI: 10.1109/ICPADS.1996.517551
Regular:

Since Gallager, Humblet and Spira first introduced the distributed Minimum Spanning Tree problem, many authors have suggested ways to enhance their basic algorithm to improve its performance. Most... View More

Advertisement