{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:36:11Z","timestamp":1762299371079},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T00:00:00Z","timestamp":1590105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T00:00:00Z","timestamp":1590105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00373-020-02182-9","type":"journal-article","created":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T11:02:56Z","timestamp":1590145376000},"page":"1311-1335","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Burning the Plane"],"prefix":"10.1007","volume":"36","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[]},{"given":"Karen","family":"Gunderson","sequence":"additional","affiliation":[]},{"given":"Amy","family":"Shaw","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,22]]},"reference":[{"key":"2182_CR1","first-page":"1","volume":"20","author":"FS Benevides","year":"2013","unstructured":"Benevides, F.S., Przykucki, M.: On slowly percolating sets of minimal size in bootstrap percolation. Electron. J. Comb. 20, 1\u201320 (2013)","journal-title":"Electron. J. Comb."},{"key":"2182_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/130941584","volume":"29","author":"FS Benevides","year":"2015","unstructured":"Benevides, F.S., Przykucki, M.: Maximum percolation time in two-dimensional bootstrap percolation. SIAM J. Discret. Math. 29, 224\u2013251 (2015)","journal-title":"SIAM J. Discret. Math."},{"key":"2182_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2017.07.016","volume":"232","author":"S Bessy","year":"2017","unstructured":"Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73\u201387 (2017)","journal-title":"Discret. Appl. Math."},{"key":"2182_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.dam.2017.09.012","volume":"235","author":"S Bessy","year":"2018","unstructured":"Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Bounds on the burning number. Discret. Appl. Math. 235, 16\u201322 (2018)","journal-title":"Discret. Appl. Math."},{"key":"2182_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-13123-8_2","volume":"8882","author":"A Bonato","year":"2014","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph as a model of social contagion. Lect. Notes Comput. Sci. 8882, 13\u201322 (2014)","journal-title":"Lect. Notes Comput. Sci."},{"key":"2182_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/15427951.2015.1103339","volume":"12","author":"A Bonato","year":"2016","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Internet Math. 12, 85\u2013100 (2016)","journal-title":"Internet Math."},{"key":"2182_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-14812-6_6","volume":"11436","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Kamali, S.: Approximation and algorithms for burning graphs. Lect. Notes Comput. Sci. 11436, 74\u201392 (2019)","journal-title":"Lect. Notes Comput. Sci."},{"key":"2182_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2018.05.035","volume":"794","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Lidbetter, T.: Bounds on the burning numbers of spiders and path-forests. Theoret. Comput. Sci. 794, 12\u201319 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"2182_CR9","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52, 2508\u20132530 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2182_CR10","first-page":"1814","volume":"23","author":"L Cai","year":"2009","unstructured":"Cai, L., Wang, W.: The surviving rate of a graph for the firefighter problem. SIAM J. Discret. Math. 23, 1814\u20131826 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"2182_CR11","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. Australas. J. Comb. 43, 57\u201377 (2009)","journal-title":"Australas. J. Comb."},{"key":"2182_CR12","unstructured":"Fitzpatrick, S.L., Wilm, L.: Burning circulant graphs. Preprint (2018)"},{"key":"2182_CR13","doi-asserted-by":"crossref","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 1420\u20131443 (1978)","DOI":"10.1086\/226707"},{"key":"2182_CR14","first-page":"61","volume-title":"Bernoulli 1713 Bayes 1763 Laplace 1813","author":"JM Hammersley","year":"1965","unstructured":"Hammersley, J.M., Welsh, D.J.A.: First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In: Neyman, J., LeCam, L.M. (eds.) Bernoulli 1713 Bayes 1763 Laplace 1813, pp. 61\u2013110. Springer, Berlin (1965)"},{"key":"2182_CR15","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1214\/aop\/1176996493","volume":"2","author":"TE Harris","year":"1974","unstructured":"Harris, T.E.: Contact interactions on a lattice. Ann. Probab. 2, 969\u2013988 (1974)","journal-title":"Ann. Probab."},{"key":"2182_CR16","unstructured":"Hartnell, B.L.: Firefighter! an application of domination. In: Presentation at 25th Manitoba Conference on Combinatorial Mathematics and Computing, University of Manitoba in Winnipeg, MB (1995)"},{"key":"2182_CR17","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. Proc. Natl. Acad. Sci. USA 111, 8788\u20138790 (2014)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2182_CR18","doi-asserted-by":"crossref","unstructured":"Land, M., Lu, L.: An upper bound on the burning number of graphs. In: Algorithms and models for the web graph, pp. 1\u20138. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-49787-7_1"},{"key":"2182_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00373-017-1768-5","volume":"33","author":"D Mitsche","year":"2017","unstructured":"Mitsche, D., Pra\u0142at, P., Roshanbin, E.: Burning graphs\u2014a probabilistic perspective. Graphs Comb. 33, 449\u2013471 (2017)","journal-title":"Graphs Comb."},{"key":"2182_CR20","first-page":"1","volume":"19","author":"M Przykucki","year":"2012","unstructured":"Przykucki, M.: Maximal percolation times in hypercubes under 2-bootstrap percolation. Electron. J. Comb. 19, 1\u201313 (2012)","journal-title":"Electron. J. Comb."},{"key":"2182_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0305004100077288","volume":"74","author":"D Richardson","year":"1973","unstructured":"Richardson, D.: Random growth in a tessellation. Math. Proc. Camb. Philos. Soc. 74, 515\u2013528 (1973)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2182_CR22","unstructured":"Roshanbin, E.: Burning a graph as a model of social contagion. PhD thesis, Dalhousie University, Halifax, NS (2016)"},{"key":"2182_CR23","volume-title":"Micromotives and Macrobehavior","author":"T Schelling","year":"1978","unstructured":"Schelling, T.: Micromotives and Macrobehavior. Norton, New York (1978)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02182-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02182-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02182-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T23:22:57Z","timestamp":1621639377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02182-9"}},"subtitle":["Densities of the Infinite Cartesian Grid"],"short-title":[],"issued":{"date-parts":[[2020,5,22]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2182"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02182-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,22]]},"assertion":[{"value":"20 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}