Abstract
Given a graph G and an integer k, the Graph Burning problem asks whether the graph G can be burned in at most k rounds. Graph burning is a model for information spreading in a network, where we study how fast the information spreads in the network through its vertices. In each round, the fire is started at an unburned vertex, and fire spreads from every burned vertex to all its neighbors in the subsequent round burning all of them and so on. The minimum number of rounds required to burn the whole graph G is called the burning number of G. Graph Burning is NP-hard even for the union of disjoint paths. Moreover, Graph Burning is known to be W[1]-hard when parameterized by the burning number and para-NP-hard when parameterized by treewidth. In this paper, we prove the following results:
-
In this paper, we give an explicit algorithm for the problem parameterized by treewidth, \(\tau \) and k, that runs in time \(k^{2\tau }4^k5^{\tau }n^{O(1)}\). This also gives an FPT algorithm for Graph Burning parameterized by burning number for apex-minor-free graphs.
-
Y. Kobayashi and Y. Otachi [Algorithmica 2022] proved that the problem is FPT parameterized by distance to cographs and gave a double exponential time FPT algorithm parameterized by distance to split graphs. We improve these results partially and give an FPT algorithm for the problem parameterized by distance to cographs \(\cap \) split graphs (threshold graphs) that runs in \(2^{\mathcal {O}(t\ln t)}\) time.
-
We design a kernel of exponential size for Graph Burning in trees.
-
Furthermore, we give an exact algorithm to find the burning number of a graph that runs in time \(2^n n^{\mathcal {O}(1)}\), where n is the number of vertices in the input graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Proofs of results that are marked with [*] are omitted due to the space constraint.
References
Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73–87 (2017)
Bonato, A.: A survey of graph burning. arXiv preprint arXiv:2009.10642 (2020)
Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph as a model of social contagion. In: Bonato, A., Graham, F.C., Prałat, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 13–22. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13123-8_2
Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Internet Math. 12(1–2), 85–100 (2016)
Cygan, M., et al.: Parameterized Algorithms, vol. 5. Springer, Heidelberg (2015)
Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275–291 (2000)
Gupta, A.T., Lokhande, S.A., Mondal, K.: NP-completeness results for graph burning on geometric graphs. arXiv preprint arXiv:2003.07746 (2020)
Hiller, M., Koster, A.M., Triesch, E.: On the burning number of \(p\)-caterpillars. In: Gentile, C., Stecca, G., Ventura, P. (eds.) Graphs and Combinatorial Optimization: from Theory to Applications, pp. 145–156. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-63072-0_12
Janssen, R.: The burning number of directed graphs: bounds and computational complexity. arXiv preprint arXiv:2001.03381 (2020)
Kare, A.S., Vinod Reddy, I.: Parameterized algorithms for graph burning problem. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 304–314. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25005-8_25
Kobayashi, Y., Otachi, Y.: Parameterized complexity of graph burning. Algorithmica 1–15 (2022)
Land, M.R., Lu, L.: An upper bound on the burning number of graphs. In: Bonato, A., Graham, F.C., Prałat, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 1–8. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49787-7_1
Roshanbin, E.: Burning a graph as a model for the spread of social contagion. Ph.D. thesis, Dalhousie University (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ashok, P., Das, S., Kanesh, L., Saurabh, S., Tomar, A., Verma, S. (2023). Burn and Win. In: Hsieh, SY., Hung, LJ., Lee, CW. (eds) Combinatorial Algorithms. IWOCA 2023. Lecture Notes in Computer Science, vol 13889. Springer, Cham. https://doi.org/10.1007/978-3-031-34347-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-34347-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-34346-9
Online ISBN: 978-3-031-34347-6
eBook Packages: Computer ScienceComputer Science (R0)