Balancing a Complete Signed Graph by Editing Edges and Deleting Nodes
A signed graph is a simple undirected graph in which each edge is either positive or negative. A signed graph is balanced if every cycle has even numbers of negative edges. In this paper we study the problem of balancing a complete signed graph by minimum editing cost, in which the editing operations includes inserting edges, deleting edges, and deleting nodes. We design a branch-and-bound algorithm, as well as a heuristic algorithm. By experimental results we show that the branch-and-bound algorithm is much efficient than a trivial one and the heuristic algorithm performs well.
Keywordsalgorithm social network analysis signed graph balanced graph
Unable to display preview. Download preview PDF.
- 10.Harary, F.: On the notion of balance of a signed graph. Michigan Mathematical Journal, 143–146 (1953)Google Scholar
- 12.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)Google Scholar
- 14.Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)Google Scholar
- 15.Wei, P.-S., Wu, B.Y.: Balancing a complete signed graph by changing minimum number of edge signs. In: Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, (2012)Google Scholar