A parallel MSF algorithm for planar graphs on a mesh and applications to image processing

Document Type

Conference Proceeding

Publication Date

1-1-1993

Abstract

The author presents an efficient O(n) parallel algorithm for finding a minimum-cost spanning forest (MSF) of a weighted undirected planar graph with n2 edges, on an nn mesh-connected computer. He also obtains efficient MSF-based O(n) algorithms for several application problems in image processing. In particular, he shows that an MSF can be used to obtain more efficient and elegant O(n) algorithms for the 'k-width connectivity' problem and the 'optical clustering' problem.

Identifier

85063390210 (Scopus)

ISBN

[0818634421, 9780818634420]

Publication Title

Proceedings of 7th International Parallel Processing Symposium IPPS 1993

External Full Text Location

https://doi.org/10.1109/IPPS.1993.262882

First Page

205

Last Page

211

This document is currently not available here.

Share

COinS