{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:51Z","timestamp":1759639011012},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"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-29516-9_16","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"185-196","source":"Crossref","is-referenced-by-count":3,"title":["Contagious Sets in Dense Graphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Freund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Poloczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Reichman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411, 4017\u20134022 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Amini, H., Cont, R. Minca, A.: Resilience to contagion in financial networks. Math. Finance (2013)","DOI":"10.1111\/mafi.12051"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-35311-6_34","volume-title":"Internet and Network Economics","author":"H Amini","year":"2012","unstructured":"Amini, H., Fountoulakis, N.: What I tell you three times is true: bootstrap percolation in small worlds. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 462\u2013474. Springer, Heidelberg (2012)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/s00440-005-0451-6","volume":"134","author":"J Balogh","year":"2006","unstructured":"Balogh, J., Bollob\u00e1s, B.: Bootstrap percolation on the hypercube. Prob. Theor. Relat. Fields 134, 624\u2013648 (2006)","journal-title":"Prob. Theor. Relat. Fields"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1090\/S0002-9947-2011-05552-2","volume":"364","author":"J Balogh","year":"2012","unstructured":"Balogh, J., Bollob\u00e1s, B., Duminil-Copin, H., Morris, R.: The sharp threshold for bootstrap percolation in all dimensions. Trans. Am. Math. Soc. 364, 2667\u20132701 (2012)","journal-title":"Trans. Am. Math. Soc."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<409::AID-RSA11>3.0.CO;2-U","volume":"13","author":"J Balogh","year":"1998","unstructured":"Balogh, J., Pete, G.: Random disease on the square grid. Random Struct. Algorithms 13, 409\u2013422 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/rsa.20158","volume":"30","author":"J Balogh","year":"2007","unstructured":"Balogh, J., Pittel, B.: Bootstrap percolation on the random regular graph. Random Struct. Algorithms 30, 257\u2013286 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"L31","DOI":"10.1088\/0022-3719\/12\/1\/008","volume":"12","author":"J Chalupa","year":"1979","unstructured":"Chalupa, J., Leath, P.L., Reich, G.R.: Bootstrap percolation on a Bethe lattice. J. Phys. C Solid State Phys. 12, L31 (1979)","journal-title":"J. Phys. C Solid State Phys."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23, 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious sets in expanders. In: Proceedings of the 26th Symposium on Discrete Algorithms (SODA 2015), pp. 1953\u20131987 (2015)","DOI":"10.1137\/1.9781611973730.131"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1214\/11-AAP822","volume":"22","author":"S Janson","year":"2012","unstructured":"Janson, S., \u0141uczak, T., Turova, T., Vallier, T.: Bootstrap percolation on the random graph \n                    \n                      \n                    \n                    $$G_{n, p}$$\n                  . Ann. Appl. Prob. 22, 1989\u20132047 (2012)","journal-title":"Ann. Appl. Prob."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theor. Comput. 11, 105\u2013147 (2015)","journal-title":"Theor. Comput."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","volume":"3","author":"A Nichterlein","year":"2013","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3, 233\u2013256 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Am. Math. Monthly 67, 55 (1960)","journal-title":"Am. Math. Monthly"},{"key":"16_CR15","first-page":"1","volume":"19","author":"M Przykucki","year":"2012","unstructured":"Przykucki, M.: Maximal percolation time in hypercubes under two-dimensional bootstrap percolation. Electron. J. Comb. 19, 1\u201313 (2012)","journal-title":"Electron. J. Comb."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1016\/j.disc.2012.01.016","volume":"312","author":"D Reichman","year":"2012","unstructured":"Reichman, D.: New bounds for contagious sets. Discrete Math. 312, 1812\u20131814 (2012)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:47:31Z","timestamp":1559400451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}