Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4672823 | Indagationes Mathematicae | 2016 | 19 Pages |
Abstract
Let AA be a finite set, and let a symmetric binary relation be given on AA. The goal of correlation clustering is to find a partition of AA, with minimal conflicts with respect to the relation given. In this paper we investigate correlation clustering of subsets of the positive integers, based upon a relation defined by the help of the greatest common divisor.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
László Aszalós, Lajos Hajdu, Attila Pethő,