{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T19:11:47Z","timestamp":1783537907510,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,13]],"date-time":"2016-04-13T00:00:00Z","timestamp":1460505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,4,13]],"date-time":"2016-04-13T00:00:00Z","timestamp":1460505600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1452425"],"award-info":[{"award-number":["1452425"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1408287"],"award-info":[{"award-number":["1408287"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1408287"],"award-info":[{"award-number":["1408287"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-14-1-0029"],"award-info":[{"award-number":["W911NF-14-1-0029"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005801","name":"Facebook","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005014","name":"Northrop Grumman","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005014","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10618-015-0447-5","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T10:42:04Z","timestamp":1460630524000},"page":"1395-1425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":86,"title":["Optimizing network robustness by edge rewiring: a general framework"],"prefix":"10.1007","volume":"30","author":[{"given":"Hau","family":"Chan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leman","family":"Akoglu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,13]]},"reference":[{"key":"447_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining\u2014volume Part II, PAKDD\u201910, pp 410\u2013421","DOI":"10.1007\/978-3-642-13672-6_40"},{"issue":"6794","key":"447_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A-L (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"key":"447_CR3","doi-asserted-by":"crossref","unstructured":"Baras J, Hovareshti P (2009) Efficient and robust communication topologies for distributed decision making in networked systems. In: Proceedings of the 48th IEEE conference on decision and control, held jointly with the 2009 28th Chinese control conference, CDC\/CCC\u201909, pp 3751\u20133756","DOI":"10.1109\/CDC.2009.5400448"},{"issue":"3\u20134","key":"447_CR4","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.physa.2005.03.040","volume":"357","author":"A Beygelzimer","year":"2005","unstructured":"Beygelzimer A, Grinstein G, Linsker R, Rish I (2005) Improving network robustness by edge modification. Phys A Stat Mech Appl 357(3\u20134):593\u2013612","journal-title":"Phys A Stat Mech Appl"},{"key":"447_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer AE, Haemers WH (2012) Spectra of graphs. Springer, New York"},{"key":"447_CR6","doi-asserted-by":"crossref","unstructured":"Buekenhout F, Parker M (1998) The number of nets of the regular convex polytopes in dimension $$\\le $$4. Discret Math 186(1\u20133):69\u201394","DOI":"10.1016\/S0012-365X(97)00225-2"},{"issue":"4","key":"447_CR7","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1284680.1284681","volume":"10","author":"D Chakrabarti","year":"2008","unstructured":"Chakrabarti D, Wang Y, Wang C, Leskovec J, Faloutsos C (2008) Epidemic thresholds in real networks. ACM Trans Inf Syst Secur 10(4):1:1\u20131:26","journal-title":"ACM Trans Inf Syst Secur"},{"key":"447_CR8","doi-asserted-by":"crossref","unstructured":"Chan H, Akoglu L, Tong H (2014) Make it or break it: manipulating robustness in large networks. In: Proceedings of the 2014 SIAM international conference on data mining, SDM\u201914, pp 325\u2013333","DOI":"10.1137\/1.9781611973440.37"},{"key":"447_CR9","doi-asserted-by":"crossref","unstructured":"Chan H, Han S, Akoglu L (2015) Where graph topology matters: the robust subgraph problem. In: Proceedings of the 2015 SIAM international conference on data mining, SDM\u201915, pp 10\u201318","DOI":"10.1137\/1.9781611974010.2"},{"key":"447_CR10","doi-asserted-by":"crossref","unstructured":"Chandra AK, Raghavan P, Ruzzo WL, Smolensky R (1989) The electrical resistance of a graph captures its commute and cover times. In: Proceedings of the twenty-first annual ACM symposium on theory of computing, STOC \u201989, pp 574\u2013586","DOI":"10.1145\/73007.73062"},{"key":"447_CR11","volume-title":"Spectra of graphs: theory and application","author":"DM Cvetkovi\u0107","year":"1980","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H (1980) Spectra of graphs: theory and application. Academic Press, New York"},{"key":"447_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"L da F Costa","year":"2007","unstructured":"Costa L da F, Rodrigues F\u00a0A, Travieso G, Boas P\u00a0R\u00a0V (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56:167\u2013242","journal-title":"Adv Phys"},{"key":"447_CR13","unstructured":"Ellens W, Kooij RE (2013) Graph measures and network robustness. CoRR 1\u201313. arxiv:1311.5064"},{"issue":"10","key":"447_CR14","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1016\/j.laa.2011.02.024","volume":"435","author":"W Ellens","year":"2011","unstructured":"Ellens W, Spieksma F, Van Mieghem P, Jamakovic A, Kooij R (2011) Effective graph resistance. Linear Algebra Appl 435(10):2491\u20132506","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"447_CR15","first-page":"563","volume":"52","author":"E Estrada","year":"2006","unstructured":"Estrada E (2006) Network robustness to targeted attacks. The interplay of expansibility and degree distribution. Phys J B Complex Syst 52(4):563\u2013574","journal-title":"Phys J B Complex Syst"},{"issue":"3","key":"447_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.physrep.2012.01.006","volume":"514","author":"E Estrada","year":"2012","unstructured":"Estrada E, Hatano N, Benzi M (2012) The physics of communicability in complex networks. Phys Rep 514(3):89\u2013119","journal-title":"Phys Rep"},{"issue":"4","key":"447_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. SIGCOMM Comput Commun Rev 29(4):251\u2013262","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"447_CR18","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23:298\u2013305","journal-title":"Czechoslov Math J"},{"issue":"1","key":"447_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/050645452","volume":"50","author":"A Ghosh","year":"2008","unstructured":"Ghosh A, Boyd S, Saberi A (2008) Minimizing effective resistance of a graph. SIAM Rev 50(1):37\u201366","journal-title":"SIAM Rev"},{"issue":"5","key":"447_CR20","doi-asserted-by":"publisher","first-page":"056109","DOI":"10.1103\/PhysRevE.65.056109","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ, Yoon CN, Han SK (2002) Attack vulnerability of complex networks. Phys Rev E 65(5):056109","journal-title":"Phys Rev E"},{"key":"447_CR21","doi-asserted-by":"crossref","unstructured":"Jamakovic A, Van Mieghem P (2008) On the robustness of complex networks by using the algebraic connectivity. In: Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet, NETWORKING\u201908, pp 183\u2013194","DOI":"10.1007\/978-3-540-79549-0_16"},{"issue":"1","key":"447_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randi\u0107 M (1993) Resistance distance. Math Chem 12(1):81\u201395","journal-title":"Math Chem"},{"key":"447_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1088\/1367-2630\/9\/6\/188","volume":"9","author":"V Latora","year":"2007","unstructured":"Latora V, Marchiori M (2007) A measure of centrality based on the network efficiency. New J Phys 9:188","journal-title":"New J Phys"},{"key":"447_CR24","unstructured":"Le LT, Eliassi-Rad T, Tong H (2015) Met: a fast algorithm for minimizing propagation in large graphs with small eigen-gaps. In: Proceedings of the 2015 SIAM international conference on data mining, SDM\u201915, pp 694\u2013702"},{"key":"447_CR25","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1093\/comnet\/cnt010","volume":"1","author":"VHP Louzada","year":"2013","unstructured":"Louzada VHP, Daolio F, Herrmann HJ, Tomassini M (2013) Smart rewiring for network robustness. J Complex Netw 1:150\u2013159","journal-title":"J Complex Netw"},{"key":"447_CR26","doi-asserted-by":"crossref","unstructured":"Malliaros FD, Megalooikonomou V, Faloutsos C (2012) Fast robustness estimation in large social graphs: communities and anomaly detection. In: Proceedings of the 2012 SIAM international conference on data mining, SDM\u201912, pp 942\u2013953","DOI":"10.1137\/1.9781611972825.81"},{"issue":"1","key":"447_CR27","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw TC, Murray AT (2009) Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. Comput Oper Res 36(1):16\u201326","journal-title":"Comput Oper Res"},{"issue":"6","key":"447_CR28","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2008.09.001","volume":"36","author":"D Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama D (2008) Maximum algebraic connectivity augmentation is np-hard. Oper Res Lett 36(6):677\u2013679","journal-title":"Oper Res Lett"},{"key":"447_CR29","doi-asserted-by":"publisher","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) Mixing patterns in networks. Phys Rev E 67:026126","journal-title":"Phys Rev E"},{"key":"447_CR30","doi-asserted-by":"crossref","unstructured":"Saha S, Adiga A, Prakash BA, Vullikanti AKS (2015) Approximation algorithms for reducing the spectral radius to control epidemic spread. In: Proceedings of the 2015 SIAM international conference on data mining, SDM\u201915, pp 568\u2013576","DOI":"10.1137\/1.9781611974010.64"},{"issue":"1","key":"447_CR31","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TMC.2011.248","volume":"12","author":"S Scellato","year":"2013","unstructured":"Scellato S, Leontiadis I, Mascolo C, Basu P, Zafer M (2013) Evaluating temporal robustness of mobile networks. IEEE Trans Mob Comput 12(1):105\u2013117","journal-title":"IEEE Trans Mob Comput"},{"issue":"10","key":"447_CR32","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider CM, Moreira AA, Andrade JS, Havlin S, Herrmann HJ (2011) Mitigation of malicious attacks on networks. Proc Natl Acad Sci 108(10):3838\u20133841","journal-title":"Proc Natl Acad Sci"},{"key":"447_CR33","volume-title":"Matrix perturbation theory","author":"GW Stewart","year":"1990","unstructured":"Stewart GW, Sun J-G (1990) Matrix perturbation theory. Academic Press, New York"},{"issue":"1\/2","key":"447_CR34","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1504\/IJSN.2007.012823","volume":"2","author":"F Sun","year":"2007","unstructured":"Sun F, Shayman MA (2007) On pairwise connectivity of wireless multihop networks. Int J Netw Secur 2(1\/2):37\u201349","journal-title":"Int J Netw Secur"},{"issue":"10","key":"447_CR35","doi-asserted-by":"crossref","first-page":"5465","DOI":"10.1016\/j.amc.2012.11.002","volume":"219","author":"A Sydney","year":"2013","unstructured":"Sydney A, Scoglio C, Gruenbacher D (2013) Optimizing algebraic connectivity by edge rewiring. Appl Math Comput 219(10):5465\u20135479","journal-title":"Appl Math Comput"},{"key":"447_CR36","doi-asserted-by":"crossref","unstructured":"Tong H, Prakash BA, Eliassi-Rad T, Faloutsos M, Faloutsos C (2012) Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on information and knowledge management, CIKM \u201912, pp 245\u2013254","DOI":"10.1145\/2396761.2396795"},{"key":"447_CR37","doi-asserted-by":"crossref","unstructured":"Tong H, Prakash BA, Tsourakakis C, Eliassi-Rad T, Faloutsos C, Chau DH (2010) On the vulnerability of large graphs. In: Proceedings of the 2010 IEEE international conference on data mining, ICDM \u201910, pp 1091\u20131096","DOI":"10.1109\/ICDM.2010.54"},{"key":"447_CR38","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. In: Proceedings of the 2008 eighth IEEE international conference on data mining, ICDM \u201908, pp 608\u2013617","DOI":"10.1109\/ICDM.2008.72"},{"key":"447_CR39","doi-asserted-by":"publisher","first-page":"016101","DOI":"10.1103\/PhysRevE.84.016101","volume":"84","author":"P Van Mieghem","year":"2011","unstructured":"Van Mieghem P, Stevanovi\u0107 D, Kuipers F, Li C, van de Bovenkamp R, Liu D, Wang H (2011) Decreasing the spectral radius of a graph by link removals. Phys Rev E 84:016101","journal-title":"Phys Rev E"},{"issue":"4","key":"447_CR40","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1140\/epjb\/e2010-00219-x","volume":"76","author":"P Van Mieghem","year":"2010","unstructured":"Van Mieghem P, Wang H, Ge X, Tang S, Kuipers FA (2010) Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur Phys J B 76(4):643\u2013652","journal-title":"Eur Phys J B"},{"key":"447_CR41","unstructured":"Wang H, Van Mieghem P (2008) Algebraic connectivity optimization via link addition. In: Proceedings of the 3rd international conference on bio-inspired models of network, information and computing systems, BIONETICS \u201908, pp 22:1\u201322:8"},{"issue":"7","key":"447_CR42","doi-asserted-by":"publisher","first-page":"078902","DOI":"10.1088\/0256-307X\/27\/7\/078902","volume":"27","author":"J Wu","year":"2010","unstructured":"Wu J, Mauricio B, Tan Y-J, Deng H-Z (2010) Natural connectivity of complex networks. Chin Phys Lett 27(7):078902","journal-title":"Chin Phys Lett"},{"key":"447_CR43","doi-asserted-by":"publisher","first-page":"066130","DOI":"10.1103\/PhysRevE.85.066130","volume":"85","author":"A Zeng","year":"2012","unstructured":"Zeng A, Liu W (2012) Enhancing network robustness against malicious attacks. Phys Rev E 85:066130","journal-title":"Phys Rev E"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0447-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0447-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0447-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0447-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T19:12:22Z","timestamp":1718478742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0447-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,13]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["447"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0447-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,13]]},"assertion":[{"value":"13 December 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}