Minimum Spanning Tree Algorithm On An Image Understanding Architecture

Abstract

A parallel algorithm for computing the minimum spanning tree of a weighted, undirected graph on an n x n mesh-connected array with a special "gated connection network" is presented. For a graph of n vertices, the algorithm requires O(log2n) time. At each step in the parallel algorithm, each node selects one of its links with the least cost as a spanning tree link. Linked nodes form connected components, so that each node eventually belongs to a group with its own identity. The connected components and their associated indices are then treated as super nodes at the next minimum link determination step. The gated connection network function is to allow all the nodes within a connected component to be electrically connected, regardless of where they are located in the adjacency matrix. The index or label used for that component is the local minimum of the node index. All the connected component operations, and those for finding minimum links between them, can be performed in parallel.© (1988) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.