Evaluating balancing on social networks through the efficient solution of correlation clustering problems
From MaRDI portal
Publication:1688940
DOI10.1007/s13675-017-0082-6zbMath1386.90161OpenAlexW2585973110MaRDI QIDQ1688940
Yuri Frota, Mario Levorato, L. M. A. Drummond, Rosa M. V. Figueiredo
Publication date: 12 January 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-017-0082-6
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Approximation methods and heuristics in mathematical programming (90C59) Signed and weighted graphs (05C22)
Related Items (6)
A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ A modeling and computational study of the frustration index in signed networks ⋮ Approximation algorithms on \(k\)-correlation clustering ⋮ Rethinking structural balance in signed social networks ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Community detection by modularity maximization using GRASP with path relinking
- Separator-based data reduction for signed graph balancing
- Correlation clustering
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Cliques and clustering: A combinatorial approach
- Variable neighborhood search
- Towards the determination of the optimal \(p\)-cyclic SSOR
- Extracting pure network submatrices in linear programs using signed graphs.
- Greedy randomized adaptive search procedures
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- TTT plots: a perl program to create time-to-target plots
- Correlation clustering in general weighted graphs
- Clustering with qualitative information
- Pre‐transitive balance mechanisms for signed networks*
- Structural Balance: A Dynamic Perspective
- Correlation clustering with a fixed number of clusters
- Parallel Strategies for Meta-Heuristics
- Parallel Metaheuristics
- Aggregating inconsistent information
- Handbook of metaheuristics
This page was built for publication: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
