Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs

DOI10.1093/comnet/cnaa025zbMath1472.05063arXiv2011.05196OpenAlexW3102473470MaRDI QIDQ4958806

Nejat Arınık, Vincent Labatut, Rosa M. V. Figueiredo

Publication date: 15 September 2021

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.05196

zbMATH Keywords

multiple solutionssolution spacegraph partitioningsigned graphstructural balancecorrelation clustering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (2)

Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering

This page was built for publication: Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs