Fast and efficient parallel coarsest refinement
The process of merging two arbitrary partitions of a given finite set U of n elements is known as coarsest refinement. In the COARSEST REFINEMENT PROBLEM we are given two arbitrary partitions X;Y of the set U such that X = fX1;X2; : : : ;Xxg and Y = fY1;Y2; : : : ;Yyg, and determine a new partition...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85014593240&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57144 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |