Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
