Karol Golab

  • Citations Per Year
Learn More
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are(More)
  • 1