{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:15:07Z","timestamp":1743138907138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031592041"},{"type":"electronic","value":"9783031592058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59205-8_8","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:01:38Z","timestamp":1714316498000},"page":"115-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How to\u00a0Cool a\u00a0Graph"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holden","family":"Milne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trent G.","family":"Marbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teddy","family":"Mishura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0166-218X(92)90121-P","volume":"37","author":"N Alon","year":"1992","unstructured":"Alon, N.: Transmitting in the $$n$$-dimensional cube. Discret. Appl. Math. 37, 9\u201311 (1992)","journal-title":"Discret. Appl. Math."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2023.04.006","volume":"337","author":"N Behague","year":"2023","unstructured":"Behague, N., Bonato, A., Huggan, M.A., Malik, R., Marbach, T.G.: The iterated local transitivity model for hypergraphs. Discret. Appl. Math. 337, 106\u2013119 (2023)","journal-title":"Discret. Appl. Math."},{"issue":"1991","key":"8_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0097-3165(91)90021-8","volume":"56","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Compressions and isoperimetric inequalities. J. Comb. Theory Ser. A 56(1991), 47\u201362 (1991)","journal-title":"J. Comb. Theory Ser. A"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.55016\/ojs\/cdm.v16i1.71194","volume":"16","author":"A Bonato","year":"2021","unstructured":"Bonato, A.: A survey of graph burning. Contrib. Discret. Math. 16, 185\u2013197 (2021)","journal-title":"Contrib. Discret. Math."},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/097","volume-title":"An Invitation to Pursuit-Evasion Games and Graph Theory","author":"A Bonato","year":"2022","unstructured":"Bonato, A.: An Invitation to Pursuit-Evasion Games and Graph Theory. American Mathematical Society, Providence, Rhode Island (2022)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bonato, A., Chaudhary, K.: The iterated local transitivity model for tournaments. In: Proceedings of WAW 2023 (2023)","DOI":"10.1007\/978-3-031-32296-9_12"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.dam.2020.04.018","volume":"284","author":"A Bonato","year":"2020","unstructured":"Bonato, A., Chuangpishit, H., English, S., Kay, B., Meger, E.: The iterated local model for social networks. Discret. Appl. Math. 284, 555\u2013571 (2020)","journal-title":"Discret. Appl. Math."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Bonato, A., Cranston, D.W., Huggan, M.A., Marbach, T.G., Mutharasan, R.: The iterated local directed transitivity model for social networks. In: Proceedings of WAW 2020 (2020)","DOI":"10.1007\/978-3-030-48478-1_8"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"2761","DOI":"10.1007\/s00373-021-02390-x","volume":"37","author":"A Bonato","year":"2021","unstructured":"Bonato, A., English, S., Kay, B., Moghbel, D.: Improved bounds for burning fence graphs. Graphs and Combinatorics 37, 2761\u20132773 (2021)","journal-title":"Graphs and Combinatorics"},{"key":"8_CR10","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 Math. 6, 285\u2013313 (2011)","journal-title":"Internet Math."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph as a model of social contagion. In: Proceedings of WAW 2014 (2014)","DOI":"10.1007\/978-3-319-13123-8_2"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/15427951.2015.1103339","volume":"1\u20132","author":"A Bonato","year":"2016","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Internet Math. 1\u20132, 85\u2013100 (2016)","journal-title":"Internet Math."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bonato, A., Marbach, T., Marcoux, J., Nir, J.D.: The $$k$$-visibility Localization game, Preprint (2023)","DOI":"10.1016\/j.tcs.2023.114186"},{"key":"8_CR14","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":"8_CR15","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 Discovery and Data Mining (KDD) (2003)","DOI":"10.1145\/956750.956769"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Influential nodes in a diffusion model for social networks. In: Proceedings 32nd International Colloquium on Automata, Languages and Programming (ICALP) (2005)","DOI":"10.1007\/11523468_91"},{"key":"8_CR17","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-a probabilistic perspective. Graphs and Combinatorics 33, 449\u2013471 (2017)","journal-title":"Graphs and Combinatorics"},{"key":"8_CR18","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\/775047.775057"},{"key":"8_CR19","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59205-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T05:52:59Z","timestamp":1731822779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59205-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031592041","9783031592058"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59205-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}