BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-76-111
       ENTRY:: December 01, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: A DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING
               TREES IN COMPUTER-COMMUNICATION NETWORKS
        TYPE:: Technical Report
      AUTHOR:: Dalal, Yogen K.
        DATE:: June 1976
       PAGES:: 40
    ABSTRACT:: This paper presents a distributed algorithm for constructing
               minimal spanning trees in computer-communication networks.
               The algorithm can be executed concurrently and asynchronously
               by the different computers of the network. This algorithm is
               also suitable for constructing minimal spanning trees using a
               multiprocessor computer system. There are many reasons for
               constructing minimal spanning trees in computer-communication
               networks since minimal spanning tree routing is useful in
               distributed operating systems for performing broadcast, in
               adaptive routing algorithms for transmitting delay estimates,
               and in other networks like the Packet Radio Network.
       NOTES:: [Adminitrivia V1/Prg/19941201]
         END:: STAN//CSL-TR-76-111