Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs

This publication has 11 references indexed in Scilit:

• Correlation Clustering with Partial Information
  Published by Springer Nature ,2003
• Correlation clustering
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
  Published by Springer Nature ,1998
• The Complexity of Multiterminal Cuts
  SIAM Journal on Computing, 1994
• Improved bounds for the max-flow min-multicut ratio for planar and Kr, r-free graphs
  Information Processing Letters, 1993
• Approximate max-flow min-(multi)cut theorems and their applications
  Published by Association for Computing Machinery (ACM) ,1993
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  Lecture Notes in Computer Science, 1993
• The complexity of multiway cuts (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1992
• Cutting and partitioning a graph after a fixed pattern
  Published by Springer Nature ,1983
• Multi-Commodity Network Flows
  Operations Research, 1963