TY - GEN
T1 - A parallel MSF algorithm for planar graphs on a mesh and applications to image processing
AU - Nassimi, D.
N1 - Publisher Copyright:
© 1993 IEEE.
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85063390210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063390210&partnerID=8YFLogxK
U2 - 10.1109/IPPS.1993.262882
DO - 10.1109/IPPS.1993.262882
M3 - Conference contribution
AN - SCOPUS:85063390210
T3 - Proceedings of 7th International Parallel Processing Symposium, IPPS 1993
SP - 205
EP - 211
BT - Proceedings of 7th International Parallel Processing Symposium, IPPS 1993
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Parallel Processing Symposium, IPPS 1993
Y2 - 13 April 1993 through 16 April 1993
ER -