Abstract
Given a graph G=(V,E) with real positive edge weights, where each edge (u, v) is labeled either + or – depending on whether u and v have been deemed to be similar or dissimilar, the problem of correlation clustering with l clusters is to partition the vertices of G into at most l clusters to minimize the total weight of + edges between clusters and – edges within clusters. This problem for general graphs is APX-complete. A fixed-parameter tractable (FPT) algorithm is presented, where the parameter k is defined as the maximum, over all blocks B of the graph, of the number of vertices that must be removed from B to obtain a forest.
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.
