{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:08:01Z","timestamp":1778659681486,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449135","type":"print"},{"value":"9783319449142","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44914-2_5","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T21:56:02Z","timestamp":1480456562000},"page":"50-60","source":"Crossref","is-referenced-by-count":3,"title":["A Review on Network Robustness from an Information Theory Perspective"],"prefix":"10.1007","author":[{"given":"Tiago","family":"Schieber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart\u00edn","family":"Ravetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bunke, H.: Recent developments in graph matching. In: Proceedings of the 15th International Conference on Pattern Recognition, vol. 2 (2000). http:\/\/dx.doi.org\/10.1109\/ICPR.2000.906030","DOI":"10.1109\/ICPR.2000.906030"},{"issue":"1","key":"5_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.amc.2006.04.006","volume":"182","author":"M Dehmer","year":"2006","unstructured":"Dehmer, M., Emmert-Streib, F., Kilian, J.: A similarity measure for graphs with low computational complexity. Appl. Math. Comput. 182(1), 447\u2013459 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"5_CR3","first-page":"167","volume":"56","author":"L Rodrigues","year":"2006","unstructured":"Rodrigues, L., Travieso, G., Boas, P.R.V.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167\u2013242 (2006)","journal-title":"Adv. Phys."},{"issue":"1","key":"5_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Survey: graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"5_CR5","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s10851-012-0383-6","volume":"47","author":"L Bai","year":"2013","unstructured":"Bai, L., Hancock, E.R.: Graph kernels from the Jensen-Shannon divergence. J. Math. Imaging Vis. 47(1\u20132), 60\u201369 (2013)","journal-title":"J. Math. Imaging Vis."},{"issue":"12","key":"5_CR6","doi-asserted-by":"crossref","first-page":"e80783","DOI":"10.1371\/journal.pone.0080783","volume":"8","author":"TA Schieber","year":"2013","unstructured":"Schieber, T.A., Ravetti, M.G.: Simulating the dynamics of scale-free networks via optimization. PLoS ONE 8(12), e80783 (2013)","journal-title":"PLoS ONE"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. Arxiv, January 2016. http:\/\/arxiv.org\/abs\/1512.03547","DOI":"10.1145\/2897518.2897542"},{"issue":"11","key":"5_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2012-30413-7","volume":"85","author":"LC Carpi","year":"2012","unstructured":"Carpi, L.C., Saco, P.M., Rosso, O.A., Ravetti, M.G.: Structural evolution of the tropical pacific climate network. Eur. Phys. J. B 85(11), 1\u20137 (2012). http:\/\/dx.doi.org\/10.1140\/epjb\/e2012-30413-7","journal-title":"Eur. Phys. J. B"},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.physleta.2015.10.055","volume":"380","author":"TA Schieber","year":"2016","unstructured":"Schieber, T.A., Carpi, L., Frery, A.C., Rosso, O.A., Pardalos, P.M., Ravetti, M.: Information theory perspective on network robustness. Phys. Lett. A 380(3), 359\u2013364 (2016)","journal-title":"Phys. Lett. A"},{"key":"5_CR10","unstructured":"Schieber, T.A., Carpi, L., Ravetti, M., Pardalos, P.M., Massoler, C., Diaz Guilera, A.: A size independent network difference measure based on information theory quantifiers (2016, Unpublished)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.physleta.2010.12.038","volume":"375","author":"LC Carpi","year":"2011","unstructured":"Carpi, L.C., Rosso, O.A., Saco, P.M., Ravetti, M.: Analyzing complex networks evolution through information theory quantifiers. Phys. Lett. A 375(4), 801\u2013804 (2011). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S037596011001577X","journal-title":"Phys. Lett. A"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2001)","journal-title":"Phys. Rev. E"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Deza, M.M., Deza, E.: Encyclopedia of Distances, p. 590. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00234-2"},{"key":"5_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9780470400791","volume-title":"Network Science: Theory and Applications","author":"TG Lewis","year":"2009","unstructured":"Lewis, T.G.: Network Science: Theory and Applications. Wiley Publishing, Hoboken (2009)"},{"issue":"290","key":"5_CR15","first-page":"290","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publ. Math. 6(290), 290\u2013297 (1959)","journal-title":"Publ. Math."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Albert, R., Barab\u00e1si, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002). http:\/\/arxiv.org\/abs\/cond-mat\/0106096","DOI":"10.1103\/RevModPhys.74.47"},{"issue":"395","key":"5_CR17","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank, O., Strauss, D.: Markov graphs. J. Am. Stat. Assoc. 81(395), 832\u2013842 (1986)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"5_CR18","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(1), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"5_CR19","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036121","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2000","unstructured":"Cox, T.F., Cox, T.F.: Multidimensional Scaling, 2nd edn. Chapman and Hall\/CRC, Boca Raton (2000). http:\/\/www.amazon.com\/Multidimensional-Scaling-Second-Trevor-Cox\/dp\/1584880945","edition":"2"},{"issue":"7","key":"5_CR20","doi-asserted-by":"crossref","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(7), 2193\u20132200 (2009). http:\/\/dx.doi.org\/10.1016\/j.cor.2008.08.016","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"5_CR21","doi-asserted-by":"crossref","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. Netw. 20(2), 609\u2013619 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/978-3-642-30850-5_34","volume-title":"Experimental Algorithms","author":"JL Walteros","year":"2012","unstructured":"Walteros, J.L., Pardalos, P.M.: A decomposition approach for solving critical clique detection problems. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 393\u2013404. Springer, Heidelberg (2012)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT - the Koblenz network collection. In: Proceedings of International Web Observatory Workshop (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"5_CR24","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella, L., Stehl\u00e9, J., Barrat, A., Cattuto, C., Pinton, J.F., den Broeck, W.V.: What\u2019s in a crowd? analysis of face-to-face behavioral networks. J. Theor. Biol. 271(1), 166\u2013180 (2011)","journal-title":"J. Theor. Biol."},{"issue":"4","key":"5_CR25","doi-asserted-by":"crossref","first-page":"e59613","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"S Iyer","year":"2013","unstructured":"Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59613 (2013)","journal-title":"PLoS ONE"},{"key":"5_CR26","unstructured":"Train bombing network dataset - KONECT, January 2016"},{"issue":"5","key":"5_CR27","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1511\/2006.61.3495","volume":"94","author":"B Hayes","year":"2006","unstructured":"Hayes, B.: Connecting the dots. Can the tools of graph theory and social-network studies unravel the next big plot? Am. Sci. 94(5), 400\u2013404 (2006)","journal-title":"Am. Sci."},{"issue":"1","key":"5_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J Lin","year":"1991","unstructured":"Lin, J.: Divergence measures based on the Shannon entropy. IEEE Trans. Inf. Theory 37(1), 145\u2013151 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"5_CR29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245\u2013251 (2010)","journal-title":"Soc. Netw."}],"container-title":["Lecture Notes in Computer Science","Discrete Optimization and Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44914-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T16:03:10Z","timestamp":1601222590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}