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

DOI10.17223/20710410/64/9MaRDI QIDQ6573407

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

Publication date: 16 July 2024

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

zbMATH Keywords

signed graphpotential functionscorrelation clusteringalgorithm systematization

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• Integer programming formulations and efficient local search for relaxed correlation clustering
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Short Survey on Graph Correlation Clustering with Minimization Criteria
• Algorithms and Computation
• Aggregating inconsistent information
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

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