{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:10:03Z","timestamp":1742947803150,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319067391"},{"type":"electronic","value":"9783319067407"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06740-7_22","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T21:11:06Z","timestamp":1399324266000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Preciser LP-Based Algorithm for Critical Link Set Problem in Complex Networks"],"prefix":"10.1007","author":[{"given":"Xing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LDF Costa","year":"2007","unstructured":"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\u2013242 (2007)","journal-title":"Adv. Phys."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"TN Dinh","year":"2012","unstructured":"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\u2013619 (2012)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"22_CR3","unstructured":"Shen, Y., Nguyen, N.P., Xuan Y., et al.: On the discovery of critical links and nodes for assessing network vulnerability (2012)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36, 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M Di Summa","year":"2011","unstructured":"Di Summa, M., Grosso, A.: Complexity of the critical node problem over trees. Comput. Oper. Res. 38, 1766 (2011)","journal-title":"Comput. Oper. Res."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"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\u20136 (2012)","DOI":"10.1109\/MILCOM.2012.6415629"},{"key":"22_CR7","unstructured":"Cplex, http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/Cplexoptimizer\/index.html"},{"issue":"7","key":"22_CR8","doi-asserted-by":"publisher","first-page":"e79388","DOI":"10.1371\/journal.pone.0039788","volume":"7","author":"TC Matisziw","year":"2012","unstructured":"Matisziw, T.C., Grubesic, T.H., Guo, J.: Robustness elasticity in complex networks. PLoS ONE 7(7), e79388 (2012)","journal-title":"PLoS ONE"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Nguyen, D.T., Shen, Y., Thai, M.T.: Detecting critical nodes in interdependent power networks for vulnerability assessment (2013)","DOI":"10.1109\/TSG.2012.2229398"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Thai, M.T.: Precise structural vulnerability assessment via mathematical programming. In: Military Communications Conference (MILCOM 2011), IEEE, pp 1351\u20131356","DOI":"10.1109\/MILCOM.2011.6127492"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"key":"22_CR13","volume-title":"Introduction to Operations Research","author":"FS Hillier","year":"1986","unstructured":"Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 4th edn. Holden-Day Inc, San Francisco (1986)","edition":"4"},{"key":"22_CR14","unstructured":"Gurobi, http:\/\/www.gurobi.com\/"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Krebs, V.E.: Uncloaking terrorist networks. First Monday,  7(4) (2002). http:\/\/firstmonday.org\/issues\/issue7_4\/krebs\/index.html","DOI":"10.5210\/fm.v7i4.941"},{"key":"22_CR16","unstructured":"Networkx, http:\/\/networkx.lanl.gov\/reference\/generated\/networkx.generators.random_graphs.barabasi_albert_graph.html"}],"container-title":["Advances in Intelligent Systems and Computing","Modern Trends and Techniques in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06740-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:05:24Z","timestamp":1710842724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06740-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067391","9783319067407"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06740-7_22","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}