• English
    • Deutsch
  • English 
    • English
    • Deutsch
  • Login
View Item 
  •   Home
  • Universität Ulm
  • Publikationsnachweise
  • View Item
  •   Home
  • Universität Ulm
  • Publikationsnachweise
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Burning a graph is hard

Erstveröffentlichung
2017
Authors
Bessy, Stephane
Bonato, Anthony
Janssen, Jeannette
Rautenbach, Dieter
Roshanbin, Elham
Wissenschaftlicher Artikel


Published in
Discrete Applied Mathematics ; 232 (2017). - S. 73-87. - ISSN 0166-218X. - eISSN 1872-6771
Link to publication
https://dx.doi.org/10.1016/j.dam.2017.07.016
Faculties
Fakultät für Mathematik und Wirtschaftswissenschaften
Institutions
Institut für Optimierung und Operations Research
Subject headings
[Free subject headings]: Graph burning | Computational complexity | NP-complete | 3-partition | Polynomial time algorithm | Approximation algorithm | firefighter problem
[DDC subject group]: DDC 510 / Mathematics

Metadata
Show full item record

Policy | kiz service OPARU | Contact Us
Impressum | Privacy statement
 

 

Advanced Search

Browse

All of OPARUCommunities & CollectionsPersonsInstitutionsPublication typesUlm SerialsDewey Decimal ClassesEU projects UlmDFG projects UlmOther projects Ulm

My Account

LoginRegister

Statistics

View Usage Statistics

Policy | kiz service OPARU | Contact Us
Impressum | Privacy statement