Abstract
The critical link set problem in a network is to find a certain number of links (or edges) whose removal will degrade the connectivity of the network to the maximum extent. It is a fundamental problem in the evaluation of the vulnerability or robustness of a network because the network performance highly depends on its topology. Since it is an NP-complete problem, a LP-based (linear programming-based) approximation algorithm is proposed in this paper to find out the critical link set in a given network. The algorithm is evaluated with a real-world network and random networks generated by the ER model and the BA model. The experimental results have shown that the algorithm has better precision than the best-known HILPR algorithm with a polynomial-time extra cost.
This work was partly funded by the National Natural Science Foundation of China under grant No.61100223, 61272010 and 61070199, 863 High-Tech. Program of China under grant No. 2011AA01A103, and the research project of National University of Defense Technology.
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
Costa, L.D.F., Rodrigues, F.A., Travieso, G., Villas Boas, P.R.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167–242 (2007)
Dinh, T.N., Xuan, Y., Thai, M.T., Pardalos, P.M., Znati, T.: On new approaches of assessing network vulnerability: hardness and approximation. IEEE/ACM Trans. Network. 20(2), 609–619 (2012)
Shen, Y., Nguyen, N.P., Xuan Y., et al.: On the discovery of critical links and nodes for assessing network vulnerability (2012)
Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36, 2193–2200 (2009)
Di Summa, M., Grosso, A.: Complexity of the critical node problem over trees. Comput. Oper. Res. 38, 1766 (2011)
Shen, Y., Dinh, T. N., Thai, M. T.: Adaptive algorithms for detecting critical links and nodes in dynamic networks. In: Military Communications Conference (MILCOM 2012), pp. 1–6 (2012)
Cplex, http://www-01.ibm.com/software/commerce/optimization/Cplexoptimizer/index.html
Matisziw, T.C., Grubesic, T.H., Guo, J.: Robustness elasticity in complex networks. PLoS ONE 7(7), e79388 (2012)
Nguyen, D.T., Shen, Y., Thai, M.T.: Detecting critical nodes in interdependent power networks for vulnerability assessment (2013)
Dinh, T.N., Thai, M.T.: Precise structural vulnerability assessment via mathematical programming. In: Military Communications Conference (MILCOM 2011), IEEE, pp 1351–1356
Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: Proceedings of the 15th International Conference on Extending Database Technology, ACM, pp 480–491 (2012)
Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585–591 (1997)
Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 4th edn. Holden-Day Inc, San Francisco (1986)
Gurobi, http://www.gurobi.com/
Krebs, V.E.: Uncloaking terrorist networks. First Monday, 7(4) (2002). http://firstmonday.org/issues/issue7_4/krebs/index.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhou, X., Peng, W. (2014). A Preciser LP-Based Algorithm for Critical Link Set Problem in Complex Networks. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Modern Trends and Techniques in Computer Science. Advances in Intelligent Systems and Computing, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-319-06740-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-06740-7_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06739-1
Online ISBN: 978-3-319-06740-7
eBook Packages: EngineeringEngineering (R0)