|Title:||Algorithm for Distributed Spanning Tree Construction in Dynamic Networks
|Authors:||E. Korach and M. Makowitz
|Abstract:||The main result of this paper is an algorithm that elect a leader and construct a spanning tree in a distributed network with n processors and m links, where links may fail during the execution of the algorithm. This algorihm is obtained by a natural two step extension of the Korach-Moran-Zaks algorithm for leader election in a complete network.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0401), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion