Affiliation:
1. Faculty of Science, Department of Computer Science , Dokuz Eylül University , , Izmir , Türkiye
Abstract
Abstract
Residual closeness is recently proposed as a vulnerability measure to characterize the stability of complex networks. Residual closeness is essential in the analysis of complex networks, but costly to compute. Currently, the fastest known algorithms run in polynomial time. Motivated by the fast-growing need to compute vulnerability measures on complex networks, new algorithms for computing node and edge residual closeness are introduced in this paper. Those proposed algorithms reduce the running times to Θ(n3) and Θ (n4) on unweighted networks, respectively, where n is the number of nodes.
Reference33 articles.
1. [1] A. Aytaç, Z. N. Berberler, Residual closeness for helm and sunflower graphs, TWMS J. App. Eng. Math. 7, 2 (2017) 209–220. ⇒200
2. [2] A. Aytaç, Z. N. Berberler, Robustness of regular caterpillars, Int. J. Found. Comp. Sci. 28, 7 (2017) 835–841. ⇒20010.1142/S0129054117500277
3. [3] A. Aytaç, Z. N. Odaba Berberler, Network robustness and residual closeness, RAIRO Oper. Res. 52, 3 (2018) 839–847. ⇒20010.1051/ro/2016071
4. [4] B. L. Piazza, F. S. Robertst, S. K. Stueckle, Edge-tenacious networks, Networks 25 (1995) 7–17. ⇒20010.1002/net.3230250103
5. [5] C. A. Barefoot, R. Entringer, H. Swart, Vulnerability in graphs—a comparative survey, J. Combin. Math. Combin. Comput. 1 (1987) 13–22. ⇒200