Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs

DOI10.17223/20710410/64/9MaRDI QIDQ6573407zbMATH OpenFDO

Authors Aleksandr A. Soldatenko, Daria V. Semenova, E. I. Ibragimova

Publication date 16 July 2024

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/20710410/64/9

zbMATH Keywords

algorithm systematizationcorrelation clusteringpotential functionssigned graph

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Aggregating inconsistent information: ranking and clustering
• Algorithms and Computation
• Correlation clustering
• Correlation clustering with partial information
• Correlation clustering, maximizing agreements via semidefinite programming
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Integer programming formulations and efficient local search for relaxed correlation clustering
• Introduction to algorithms.
• Short survey on graph correlation clustering with minimization criteria

This page was built for publication: Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs

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