{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:10:02Z","timestamp":1746169802286,"version":"3.40.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035352"},{"type":"electronic","value":"9783319035369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_4","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"44-55","source":"Crossref","is-referenced-by-count":0,"title":["On the Power of Adversarial Infections in Networks"],"prefix":"10.1007","author":[{"given":"Michael","family":"Brautbar","sequence":"first","affiliation":[]},{"given":"Moez","family":"Draief","sequence":"additional","affiliation":[]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6794","key":"4_CR1","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.: Error and attack tolerance of complex networks. Nature\u00a0406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N.: A note on network reliability. In: Discrete Probability and Algorithms, pp. 11\u201314. Springer (1995)","DOI":"10.1007\/978-1-4612-0801-3_2"},{"issue":"5670","key":"4_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1126\/science.1095845","volume":"304","author":"J. Balthrop","year":"2004","unstructured":"Balthrop, J., Forrest, S., Newman, M.E.J., Williamson, M.M.: Technological networks and the spread of computer viruses. Science\u00a0304(5670), 527\u2013529 (2004)","journal-title":"Science"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D. Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.F.: Toughness in graphs - a survey. Graphs and Combinatorics\u00a022(1), 1\u201335 (2006)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jagm.1998.0998","volume":"31","author":"C. Bazgan","year":"1999","unstructured":"Bazgan, C., Santha, M., Tuza, Z.: On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. J. Algorithms\u00a031(1), 249\u2013268 (1999)","journal-title":"J. Algorithms"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1239\/aap\/1198177233","volume":"39","author":"T. Britton","year":"2007","unstructured":"Britton, T., Janson, S., Martin-L\u00f6f, A.: Graphs with specified degree distributions, simple epidemics, and local vaccination strategies. Advances in Applied Probability\u00a039(4), 922\u2013948 (2007)","journal-title":"Advances in Applied Probability"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Z., Chen, C., Ji, C.: Understanding localized-scanning worms. In: IPCCC, pp. 186\u2013193 (2007)","DOI":"10.1109\/PCCC.2007.358894"},{"issue":"24","key":"4_CR8","doi-asserted-by":"crossref","first-page":"247901","DOI":"10.1103\/PhysRevLett.91.247901","volume":"91","author":"R. Cohen","year":"2003","unstructured":"Cohen, R., Havlin, S., Ben-Avraham, D.: Efficiency immunization strategies for computer networks and populations. Physical Review Letters\u00a091(24), 247901-1\u2013247901-4 (2003)","journal-title":"Physical Review Letters"},{"issue":"642","key":"4_CR9","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/S0378-4371(02)01545-5","volume":"320","author":"P. Crucitti","year":"2003","unstructured":"Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Efficiency of scale-free networks: Error and attack tolerance. Physica A\u00a0320(642), 622\u2013642 (2003)","journal-title":"Physica A"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Easley, D.A., Kleinberg, J.M.: Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithms\u00a017(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D.R. Karger","year":"1997","unstructured":"Karger, D.R., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica\u00a018(1), 82\u201398 (1997)","journal-title":"Algorithmica"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"4_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J\u00e1nos Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Limit distributions for the existence of Hamiltonian circuits in a random graph. Discrete Mathematics\u00a0(43), 55\u201363 (1983)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K. Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: A survey. Graphs and Combinatorics\u00a027(1), 1\u201326 (2011)","journal-title":"Graphs and Combinatorics"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-24663-3_2","volume-title":"Performance Tools and Applications to Networked Systems","author":"G. Serazzi","year":"2004","unstructured":"Serazzi, G., Zanero, S.: Computer virus propagation models. In: Calzarossa, M.C., Gelenbe, E. (eds.) MASCOTS 2003. LNCS, vol.\u00a02965, pp. 26\u201350. Springer, Heidelberg (2004)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Weaver, N., Paxson, V., Staniford, S., Cunningham, R.: A taxonomy of computer worms. In: WORM, pp. 11\u201318 (2003)","DOI":"10.1145\/948187.948190"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S. Win","year":"1989","unstructured":"Win, S.: On a connection between the existence of k-trees and the toughness of a graph. Graphs and Combinatorics\u00a05(1), 201\u2013205 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Yan, G., Chen, G., Eidenbenz, S., Li, N.: Malware propagation in online social networks: nature, dynamics, and defense implications. In: ASIACCS, pp. 196\u2013206 (2011)","DOI":"10.1145\/1966913.1966939"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Zou, C.C., Towsley, D.F., Gong, W.: Email worms modeling and defense. In: ICCCN, pp. 409\u2013414 (2004)","DOI":"10.1109\/ICCCN.2004.1401687"},{"issue":"7","key":"4_CR21","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.peva.2005.07.032","volume":"63","author":"C.C. Zou","year":"2006","unstructured":"Zou, C.C., Towsley, D.F., Gong, W.: On the performance of internet worm scanning strategies. Perform. Eval.\u00a063(7), 700\u2013723 (2006)","journal-title":"Perform. Eval."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Zou, C.C., Towsley, D.F., Gong, W., Cai, S.: Routing worm: A fast, selective attack worm based on IP address information. In: PADS, pp. 199\u2013206 (2005)","DOI":"10.1109\/PADS.2005.24"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:21:35Z","timestamp":1746069695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}