Title

An O (nlogn) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem

Abstract

A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite set S of n elements with respect to a function f on S. The algorithm requires O(n) processors, O(logn) time, and and O(nlogn) space in the worst case.

Department(s)

Mathematics and Statistics

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1987 Springer Verlag, All rights reserved.

Share

 
COinS