An exact method for computing the frustration index in signed networks using binary programming

28 Nov 2016Samin ArefAndrew J. MasonMark C. Wilson

Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, physics, material science, and biology. The frustration index determines the distance of a network from a state of total structural balance... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet