A distributed algorithm is presented that constructs the minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchang...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!