Short survey on graph correlation clustering with minimization criteria

DOI10.1007/978-3-319-44914-2_3MaRDI QIDQ3133198zbMATH OpenOpenAlexFDO

Authors Alexander Kononov, Victor Petrovich Il'ev, Svetlana Il'eva

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_3

zbMATH Keywords

graph clusteringcomputational complexityapproximation algorithmperformance guarantee

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Correlation Clustering
• Correlation clustering in general weighted graphs
• Algorithms - ESA 2003
• Correlation clustering
• On a semi-supervised graph clustering problem

Cited in

(5)

• Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
• Approximate algorithms for graph clustering problem
• Algorithms - ESA 2003
• On a semi-supervised graph clustering problem
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis

This page was built for publication: Short survey on graph correlation clustering with minimization criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133198)