Evaluating balancing on social networks through the efficient solution of correlation clustering problems
One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state. The solution of clustering problems defined on signed graphs can be used as...
Guardado en:
Autores principales: | Mario Levorato, Rosa Figueiredo, Yuri Frota, Lúcia Drummond |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/731f7de9829440968feee5f1a3ba8647 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A branch-and-cut algorithm for the target visitation problem
por: Achim Hildenbrandt
Publicado: (2019) -
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
por: VilmarJefté Rodrigues de Sousa, et al.
Publicado: (2019) -
Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019) -
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
por: Heiner Ackermann, et al.
Publicado: (2020) -
A modification of the αBB method for box-constrained optimization and an application to inverse kinematics
por: Gabriele Eichfelder, et al.
Publicado: (2016)