Fast computing global structural balance in signed networks based on memetic algorithm
DOI10.1016/J.PHYSA.2014.07.071zbMATH Open1395.90051OpenAlexW2006313131MaRDI QIDQ1783166FDOQ1783166
Authors: Yixiang Sun, Haifeng Du, Maoguo Gong, Lijia Ma, Shanfeng Wang 
Publication date: 20 September 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2014.07.071
Recommendations
- Approximation algorithms for balancing signed graphs
- A spectral algorithm for computing social balance
- Computing the line index of balance using integer programming optimisation
- Estimating the number of weak balance structures in signed networks
- Rethinking structural balance in signed social networks
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
Cited In (6)
- Optimizing transformations of structural balance in signed networks with potential relationships
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- How to estimate the signs' configuration in the directed signed social networks?
- Network structure optimization for social networks by minimizing the average path length
- Evolutionary prisoner's dilemma game on signed networks based on structural balance theory
- Structural balance in one time step
Uses Software
This page was built for publication: Fast computing global structural balance in signed networks based on memetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783166)
