Fast computing global structural balance in signed networks based on memetic algorithm
From MaRDI portal
Publication:1783166
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
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
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)