On a correlational clustering of integers

László Aszalós, Lajos Hajdu, A. Pethő

Research output: Contribution to journalArticle


Let A be a finite set, and let a symmetric binary relation be given on A. The goal of correlation clustering is to find a partition of A, 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.

Original languageEnglish
Pages (from-to)173-191
Number of pages19
JournalIndagationes Mathematicae
Issue number1
Publication statusPublished - Jan 1 2016



  • Correlation clustering
  • Greatest common divisor
  • Greedy algorithm
  • Pairs of coprime integers

ASJC Scopus subject areas

  • Mathematics(all)

Cite this