{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T22:41:48Z","timestamp":1773787308653,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"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":["Appl Intell"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10489-021-02411-5","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T08:08:08Z","timestamp":1621498088000},"page":"1351-1361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Faster heuristics for graph burning"],"prefix":"10.1007","volume":"52","author":[{"given":"Rahul Kumar","family":"Gautam","sequence":"first","affiliation":[]},{"given":"Anjeneya Swami","family":"Kare","sequence":"additional","affiliation":[]},{"given":"Durga Bhavani","family":"S.","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"key":"2411_CR1","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 (2018) Bounds on the burning number. Discret Appl Math 235:16\u201322","journal-title":"Discret Appl Math"},{"key":"2411_CR2","doi-asserted-by":"crossref","unstructured":"Bonato A (2020) A survey of graph burning","DOI":"10.55016\/ojs\/cdm.v16i1.71194"},{"key":"2411_CR3","doi-asserted-by":"crossref","unstructured":"Bonato A, Janssen J, Roshanbin E (2014) Burning a graph as a model of social contagion. In: Algorithms and models for the web graph, WAW 2014. Lecture Notes in Computer Science, vol 8882. Springer, pp 13\u201322","DOI":"10.1007\/978-3-319-13123-8_2"},{"issue":"1-2","key":"2411_CR4","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 (2016) How to burn a graph. Internet Math 12 (1-2):85\u2013100","journal-title":"Internet Math"},{"key":"2411_CR5","doi-asserted-by":"crossref","unstructured":"Bonato A, Kamali S (2019) Approximation algorithms for graph burning. In: Theory and applications of models of computation. TAMC 2019. Lecture Notes in Computer Science. Springer, pp 74\u201392","DOI":"10.1007\/978-3-030-14812-6_6"},{"key":"2411_CR6","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 (2019) Bounds on the burning numbers of spiders and path-forests. Theor Comput Sci 794:12\u201319","journal-title":"Theor Comput Sci"},{"issue":"4","key":"2411_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2016","unstructured":"Cordasco G, Gargano L, Rescigno A, Vaccaro U (2016) Evangelism in social networks: Algorithms and complexity. Networks 71(4):346\u2013357","journal-title":"Networks"},{"key":"2411_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","volume":"764","author":"G Cordasco","year":"2019","unstructured":"Cordasco G, Gargano L, Rescigno AA (2019) Active influence spreading in social networks. Theor Comput Sci 764:15\u201329","journal-title":"Theor Comput Sci"},{"key":"2411_CR9","unstructured":"Farokh ZR, Tahmasbi M, Tehrani ZHRA, Buali Y (2020) New heuristics for burning graphs. arXiv:2003.09314"},{"key":"2411_CR10","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow S, Macgillivray G (2009) The firefighter problem: A survey of results, directions and questions. Australas J Combin [electronic only] 43:57\u201377","journal-title":"Australas J Combin [electronic only]"},{"issue":"6","key":"2411_CR11","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/TLA.2018.8444397","volume":"16","author":"J Garcia","year":"2018","unstructured":"Garcia J, Menchaca R, Sanchez J, Menchaca R (2018) Local search algorithms for the vertex k-center problem. IEEE Lat Am Trans 16(6):1765\u20131771","journal-title":"IEEE Lat Am Trans"},{"key":"2411_CR12","unstructured":"Gupta AT, Lokhande S, Mondal K (2020) NP-completeness results for graph burning on geometric graphs. arXiv:2003.07746"},{"key":"2411_CR13","doi-asserted-by":"crossref","unstructured":"Kamali S, Miller A, Zhang K (2020) Burning two worlds: Algorithms for burning dense and tree-like graphs. In: Theory and practice of computer science, SOFSEM 2020. Lecture Notes in Computer Science. Springer, pp 113\u2013124","DOI":"10.1007\/978-3-030-38919-2_10"},{"key":"2411_CR14","doi-asserted-by":"crossref","unstructured":"Kare AS, Reddy IV (2019) Parameterized algorithms for graph burning problem. In: International workshop on combinatorial algorithms. Springer, pp 304\u2013314","DOI":"10.1007\/978-3-030-25005-8_25"},{"key":"2411_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903). pp 137\u2013146","DOI":"10.1145\/956755.956769"},{"key":"2411_CR16","unstructured":"Kobayashi Y, Otachi Y (2020) Parameterized complexity of graph burning. arXiv:2007.08811"},{"key":"2411_CR17","doi-asserted-by":"crossref","unstructured":"Land MR, Lu L (2016) An upper bound on the burning number of graphs. In: International workshop on algorithms and models for the web-graph. Springer, pp. 1\u20138","DOI":"10.1007\/978-3-319-49787-7_1"},{"key":"2411_CR18","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"2411_CR19","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cam.2019.04.024","volume":"361","author":"H Liu","year":"2019","unstructured":"Liu H, Zhang R, Hu X (2019) Burning number of theta graphs. Appl Math Comput 361:246\u2013257","journal-title":"Appl Math Comput"},{"key":"2411_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2018.06.036","volume":"746","author":"D Mitsche","year":"2018","unstructured":"Mitsche D, Pra\u0142at P, Roshanbin E (2018) Burning number of graph products. Theor Comput Sci 746:124\u2013135","journal-title":"Theor Comput Sci"},{"issue":"2","key":"2411_CR21","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 (2017) Burning graphs: A probabilistic perspective. Graphs Combin 33(2):449\u2013471","journal-title":"Graphs Combin"},{"key":"2411_CR22","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI Press, p. 4292\u20134293","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"2411_CR23","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1007\/s40840-017-0585-6","volume":"41","author":"K Sim","year":"2017","unstructured":"Sim K, Tan TS, Wong K (2017) On the burning number of generalized petersen graphs. Bull Malaysian Math Sci Soc 41:1657\u20131670","journal-title":"Bull Malaysian Math Sci Soc"},{"key":"2411_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2017.07.016","volume":"232","author":"S St\u00e9phane Bessy","year":"2017","unstructured":"St\u00e9phane Bessy S, Bonato A, Janssen J, Rautenbach DR, Roshanbin E (2017) Burning a graph is hard. Discret Appl Math 232:73\u201387","journal-title":"Discret Appl Math"},{"key":"2411_CR25","doi-asserted-by":"publisher","first-page":"3269","DOI":"10.3390\/app9163269","volume":"9","author":"M S\u0306imon","year":"2019","unstructured":"S\u0306imon M., Huraj L, Lupt\u00e1kov\u00e1 I, Posp\u00edchal J (2019) Heuristics for spreading alarm throughout a network. Appl Sci 9: 3269","journal-title":"Appl Sci"},{"issue":"2","key":"2411_CR26","doi-asserted-by":"publisher","first-page":"11","DOI":"10.13164\/mendel.2019.2.011","volume":"25","author":"M S\u0306imon","year":"2019","unstructured":"S\u0306imon M., Huraj L, Lupt\u00e1kov\u00e1 I, Posp\u00edchal J (2019) How to burn a network or spread alarm. MENDEL 25(2):11\u201318","journal-title":"MENDEL"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02411-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T09:06:11Z","timestamp":1744189571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02411-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,20]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["2411"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02411-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,20]]},"assertion":[{"value":"3 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}