Abstract
We present a more powerful heuristic algorithm for the NP-complete problem of finding a minimum size subset of edges in an unbalanced signed graph G whose ‘+’/‘−’ labels can be flipped to balance G. Our algorithm finds a minimal flipping edge-set, starting with a given spanning tree T of G, by considering both the edges not in T and those in T because flipping a tree-edge can sometimes balance multiple fundamental unbalanced cycles at the same time. This can give a much smaller minimal flipping edge-set than the current algorithm where only the edges not in T are considered for flipping.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aref, S., Neal, Z.: Detecting coalitions by optimally partitioning signed networks of political collaboration. Sci. Rep. 10(1), 1–10 (2020)
Cartwright, D., Harary, F.: Structural balance: a generalization of Heider’s theory. Psychol. Rev. 63(5), 277 (1956)
Ma’ayan, A., Lipshtat, A., Iyengar, R., Sontag, E.D.: Proximity of intracellular regulatory networks to monotone systems. IET Syst. Biol. 2(3), 103–112 (2008)
Harary, F.: On the notion of balance of a signed graph. Michigan Math. J. 2(2), 143–146 (1953)
Harary, F.: On the measurement of structural balance. Behavioral Sci. 4(4), 316–323 (1959)
Akiyama, J., Avis, D., Chvátal, V., Era, H.: Balancing signed graphs. Discrete Appl. Math. 3(4), 227–233 (1981)
Figueiredo, R., Frota, Y.: The maximum balanced subgraph of a signed graph: applications and solution approaches. Euro. J. Oper. Res. 236(2), 473–487 (2014)
Hüffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: International Workshop on Experimental and Efficient Algorithms, pp. 297–310. Springer (2007)
Ordozgoiti, B., Matakos, A., Gionis, A.: Finding large balanced subgraphs in signed networks. In: Proceedings of the Web Conference 2020, pp. 1378–1388 (2020)
Sharma, K., Gillani, I.A., Medya, S., Ranu, S., Bagchi, A.: Balance maximization in signed networks via edge deletions. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pp. 752–760 (2021)
Alabandi, G., Tešić, J., Rusnak, L., Burtscher, M.: Discovering and balancing fundamental cycles in large signed graphs. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1–17 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kundu, S., Nanavati, A.A. (2023). A More Powerful Heuristic for Balancing an Unbalanced Graph. In: Cherifi, H., Mantegna, R.N., Rocha, L.M., Cherifi, C., Micciche, S. (eds) Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016 2022. Studies in Computational Intelligence, vol 1078. Springer, Cham. https://doi.org/10.1007/978-3-031-21131-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-21131-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21130-0
Online ISBN: 978-3-031-21131-7
eBook Packages: EngineeringEngineering (R0)