[1] | Addis, B., Aringhieri, R., Grosso, A., Hosteins, P.: Hybrid constructive heuristics for the critical node problem, Annals of Operations Research, 238(1-2), 637–649 (2016). |
[2] | Addis, B., Di Summa, M., Grosso, A.: Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth, Discrete Applied Mathematics, 161(16), 2349–2360 (2013). |
[3] | Aringhieri, R., Grosso, A., Hosteins, P., Scatamacchia, R.: Local search metaheuristics for the critical node problem, Networks, 67(3), 209–221 (2016). |
[4] | Aringhieri, R., Grosso, A., Hosteins, P., Scatamacchia, R.: Polynomial and pseudopolynomial time algorithms for different classes of the distance critical node problem, Discrete Applied Mathematics, 253, 103–121 (2019). |
[5] | Arulselvan A., Commander C.W., Elefteriadou L., Pardalos P.M.: Detecting critical nodes in sparse graphs, Computers & Operations Research, 36, 2193–2200 (2009). |
[6] | Arulselvan, A., Commander, C. W., Pardalos, P. M. and Shylo, O.: Managing network risk via critical node identification, Gulpinar, N., Rustem, B. (eds.) Risk Management in Telecommunication Networks, 2010. |
[7] | Berger, A., Grigoriev, A., van der Zwaan, R.: Complexity and approximability of the k-way vertex cut, Networks, 63(2), 170–178 (2014). |
[8] | Borgatti, S.P.: Identifying sets of key players in a network, Computational and Mathematical Organization Theory, 12, 21–34 (2006). |
[9] | Brown, G., Carlyle, M., Salmerón, J., Wood, K.: Defending critical infrastructure, Interfaces, 36(6), 530–544 (2006). |
[10] | Cohen, R., Ben Avraham, D., Havlin, S.: Efficient immunization strategies for computer networks and populations, Physical Review Letters, 91, 247901–247905 (2003). |
[11] | Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees, Computers & Operations Research, 38(12), 1766–1774 (2011). |
[12] | Di Summa, M., Grosso, A., Locatelli, M.: Branch and cut algorithms for detecting critical nodes in undirected graphs, Computational Optimization and Applications, 53(3), 649–680 (2012). |
[13] | Dinh, T., Xuan, Y., Thai M.T. Park, E., Znati, T.: On approximation of new optimization methods for assessing network vulnerability, In: Proceedings of INFOCOM, IEEE (2010). |
[14] | Fan, N., Pardalos, P.: Robust optimization of graph partitioning and critical node detection in analyzing networks, In: W.Wu, O. Daescu (eds.) International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, vol. 6508, pp. 170–183. Springer (2010). |
[15] | Grubesic, T.H., Matisziw T.C., Murray, A.T., Snediker D.: Comparative approaches for assessing network vulnerability, Int. Reg. Sci. Rev., 31(1), 88–112 (2008). |
[16] | Houck, D.J., Kim, E., O’Reilly, G.P., Picklesimer, D.D., Uzunalioglu, H.: A network survivability model for critical national infrastructures, Bell Labs Technical J., 8(4), 153–172 (2004). |
[17] | Jenelius, E., Petersen, T., Mattsson, L.G.: Importance and exposure in road network vulnerability analysis, Transportation Research Part A: Policy and Practice 40(7), 537–560 (2006). |
[18] | Krebs V.: Uncloaking terrorist networks, First Monday, 7 (2002). |
[19] | Kuhlman, C., Kumar, V., Marathe, M., Ravi, S., Rosenkrantz, D.: Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In: J. Balc′azar, F. Bonchi, A. Gionis, M. Sebag (eds.) Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Lecture Notes in Computer Science, vol. 6322, pp. 111–127. Springer (2010). |
[20] | Lalou, M., Tahraoui, M., Kheddouci, H.: Component-cardinality-constrained critical node problem in graphs, Discrete Applied Mathematics, 210, 150–163 (2016). |
[21] | Lalou, M., Tahraoui, M., Kheddouci, H.: The critical node detection problem in networks: A survey, Computer Science Review, 28, 92–117 (2018). |
[22] | Miller, J. C., and Hyman, J. M.: Effective vaccination strategies for realistic social networks, Physica A: Statistical Mechanics and its Applications, 386(2): 780–785, (2007). |
[23] | Nguyen, D., Shen, Y., Thai, M.: Detecting critical nodes in interdependent power networks for vulnerability assessment, IEEE Transactions on Smart Grid, 4(1), 151–159 (2013). |
[24] | Pawson, T., Nash, P.: Protein–protein interactions define specificity in signal transduction, Genes Dev. 14(9), 1027–1047 (2000). |
[25] | Pullan, W.: Heuristic identification of critical nodes in sparse real-world graphs, Journal of Heuristics, 21(5), 577–598 (2015). |
[26] | Purevsuren, D., Cui, G., Win, N., Wang, X.: Heuristic algorithm for identifying critical nodes in graphs, Advances in Computer Science: an International Journal, 5(3), 1–4 (2016). |
[27] | Salmeron, J., Wood, K.R., Baldick, R.: Analysis of electric grid security under terrorist threat, IEEE Transactions on Power Systems, 19(2), 905–912 (2004). |
[28] | Shen, S., Smith, J.: Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs, Networks, 60(2), 103–119 (2012). |
[29] | Shen, S., Smith, J., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions, Discrete Optimization, 9(3), 172–188 (2012). |
[30] | Shen, Y., Nguyen N.P. Xuan, Y., Thai, M.: On the discovery of critical links and nodes for assessing network vulnerability, IEEE/ACM Transactions on Networking, 21(3), 963–973 (2013). |
[31] | Veremyev, A., Prokopyev, O., Pasiliao, E.: Critical nodes for distance-based connectivity and related problems in graphs, Networks, 66(3), 170–195 (2015). |
[32] | Yan, C., Wu, F., Jernigan, R.L., Dobbs, D., Honavar, V.: Characterization of protein–protein interfaces, Protein J. 27 (1), 59–70 (2008). |
[33] | Zhao, K., Kumar, A., Harrison, T. P. and Yen, J.: Analyzing the resilience of complex supply network topologies against random and targeted disruptions, IEEE Systems Journal, 5(1), 28–39 (2011). |
[34] | Zhou T., Fu Z.-Q., Wang B.-H.: Epidemic dynamics on complex networks, Progress in Natural Science, 16, 452–457 (2006). |