Correlation clustering in general weighted graphs

This publication has 20 references indexed in Scilit:

• Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs
  Published by Springer Nature ,2003
• An efficient k-means clustering algorithm: analysis and implementation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
  Journal of the ACM, 1999
• Primal-dual approximation algorithms for integral flow and multicut in trees
  Algorithmica, 1997
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
  SIAM Journal on Computing, 1996
• 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
• A unified approach to approximation algorithms for bottleneck problems
  Journal of the ACM, 1986
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
  The Computer Journal, 1983
• Cutting and partitioning a graph after a fixed pattern
  Published by Springer Nature ,1983