{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T02:04:18Z","timestamp":1779242658305,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319131221","type":"print"},{"value":"9783319131238","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13123-8_2","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T06:45:54Z","timestamp":1415947554000},"page":"13-22","source":"Crossref","is-referenced-by-count":52,"title":["Burning a Graph as a Model of Social Contagion"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeannette","family":"Janssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elham","family":"Roshanbin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/070703053","volume":"23","author":"N Alon","year":"2008","unstructured":"Alon, N., Pra\u0142at, P., Wormald, N.: Cleaning regular graphs with brushes. SIAM Journal on Discrete Mathematics 23, 233\u2013250 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2_CR2","unstructured":"Balogh, J., Bollob\u00e1s, B., Morris, R.: Graph bootstrap percolation (preprint 2014)"},{"key":"2_CR3","unstructured":"Banerjee, S., Das, A., Gopalan, A., Shakkottai, S.: Epidemic spreading with external agents. In: Proceedings of IEEE Infocom (2011)"},{"key":"2_CR4","unstructured":"Barghi, A., Winkler, P.: Firefighting on a random geometric graph. Random Structures and Algorithms (accepted)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1080\/15427951.2009.10390642","volume":"6","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Hadi, N., Horn, P., Pra\u0142at, P., Wang, C.: Models of on-line social networks. Internet Mathematics 6, 285\u2013313 (2011)","journal-title":"Internet Mathematics"},{"key":"2_CR6","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph is hard (preprint 2014)U"},{"key":"2_CR7","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (KDD) (2001)","DOI":"10.1145\/502512.502525"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","volume":"307","author":"S Finbow","year":"2007","unstructured":"Finbow, S., King, A., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discrete Mathematics 307, 2094\u20132105 (2007)","journal-title":"Discrete Mathematics"},{"key":"2_CR10","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow, S., MacGillivray, G.: The Firefighter problem: a survey of results, directions and questions. Australasian Journal of Combinatorics 43, 57\u201377 (2009)","journal-title":"Australasian Journal of Combinatorics"},{"key":"2_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W.H (1979)"},{"key":"2_CR12","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th International Conference on Knowledge scovery and Data Mining (KDD) (2003)","DOI":"10.1145\/956750.956769"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"David Kempe","year":"2005","unstructured":"Kempe, David, Kleinberg, Jon M., Tardos, \u00c9va: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, Lu\\\u2019\u0131s, Italiano, Giuseppe F., Monteiro, Lu\\\u2019\u0131s, Palamidessi, Catuscia, Yung, Moti (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proc. 32nd ACM Symp. Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"8788","DOI":"10.1073\/pnas.1320040111","volume":"111","author":"ADI Kramer","year":"2014","unstructured":"Kramer, A.D.I., Guillory, J.E., Hancock, J.T.: Experimental evidence of massive-scale emotional contagion through social networks. Proceedings of the National Academy of Sciences 111, 8788\u20138790 (2014)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A Meir","year":"1975","unstructured":"Meir, A., Moon, J.W.: Relations between packing and covering numbers of a tree. Pacific Journal of Mathematics 61, 225\u2013233 (1975)","journal-title":"Pacific Journal of Mathematics"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing (STOC) (2007)","DOI":"10.1145\/1250790.1250811"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th International Conference on Knowledge scovery and Data Mining (KDD) (2002)","DOI":"10.1145\/775056.775057"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.dam.2012.10.029","volume":"161","author":"L Small","year":"2013","unstructured":"Small, L., Mason, O.: Information diffusion on the iterated local transitivity model of online social networks. Discrete Applied Mathematics 161, 1338\u20131344 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR21","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13123-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:20:47Z","timestamp":1559053247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13123-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131221","9783319131238"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13123-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}