Burning a graph is hard

Journal article

Open access

Peer reviewed

Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach and Elham Roshanbin

Discrete Applied Mathematics, Vol.232, pp.73-87

12/2017

Abstract

Graph burning

NP-complete3-partition

Polynomial time algorithm

Approximation algorithm

Computational complexity

url

Find in HALView

url

https://doi.org/10.1016/j.dam.2017.07.016View

Published (Version of record) Open

1 Record Views

Title: Burning a graph is hard
Creators - without role: Stéphane Bessy - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Anthony Bonato - Toronto Metropolitan University
Jeannette Janssen - Dalhousie University
Dieter Rautenbach - Universität Ulm
Elham Roshanbin - Dalhousie University
Publication Details: Discrete Applied Mathematics, Vol.232, pp.73-87
Identifiers: 9939763909311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01692784