Burning Grids and Intervals

Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, an alarm, or a social contagion can be modeled using graph burning. The less the burning number, the faster the spread. Optimal burning of general graphs is NP-Hard. There is a 3-approx-imation algorithm to burn general graphs where as better approximation factors are there for many sub classes. Here we study burning of grids; provide a lower bound for burning arbitrary grids and a 2-approximation algorithm for burning square grids. On the other hand, burning path forests, spider graphs, and trees with maximum degree three is already known to be NP-Complete. In this article we show burning problem to be NP-Complete on connected interval graphs.

Original languageEnglish
Title of host publicationAlgorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings
EditorsApurva Mudgal, C. R. Subramanian
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages14
ISBN (Print)9783030678982
StatePublished - 1 Jan 2021
Externally publishedYes
Event7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 - Rupnagar, India
Duration: 11 Feb 202113 Feb 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12601 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Burning Grids and Intervals'. Together they form a unique fingerprint.

Cite this