RT journal article
T1 Overlapping communities detection through weighted graph community games
A1 Benati, Stefano
A1 Puerto, Justo
A1 Rodríguez Chía, Antonio Manuel
A1 Temprano, Francisco
A2 Estadística e Investigación Operativa
K1 Algorithms
K1 Heuristics
K1 Programming
K1 Linear
AB We propose a new model to detect the overlapping communities of a network that is basedon cooperative games and mathematical programming. More specifically, communities aredefined as stable coalitions of a weighted graph community game and they are revealed asthe optimal solution of a mixed-integer linear programming problem. Exact optimal solutionsare obtained for small and medium sized instances and it is shown that they provide usefulinformation about the network structure, improving on previous contributions. Next, a heuristic algorithm is developed to solve the largest instances and used to compare two variationsof the objective function.
PB Public Library of Science
SN 1932-6203
YR 2023
FD 2023-04-04
LK http://hdl.handle.net/10498/29744
UL http://hdl.handle.net/10498/29744
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026