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

DOI10.17223/20710410/64/9MaRDI QIDQ6573407FDOQ6573407

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)

zbMATH Keywords

signed graphpotential functionscorrelation clusteringalgorithm systematization

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Title not available (Why is that?)
• Aggregating inconsistent information: ranking and clustering
• Correlation clustering
• Correlation clustering, maximizing agreements via semidefinite programming
• Correlation clustering with partial information
• Algorithms and Computation
• 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

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)