The Firefighter problem on graph classes

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 2016 English Publisher:Elsevier BVJournal:Theoretical Computer Science, volume 613, pages 38-50 (issn: 0304-3975,

Copyright policy )Funded by:EC | PAAL

Authors: Fedor V. Fomin; Pinar Heggernes; Erik Jan van Leeuwen;

doi: 10.1016/j.tcs.2015.11.024

handle: 11858/00-001M-0000-0029-B8FB-F

The Firefighter problem on graph classes

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Bergen
Norway
Max Planck Society
Germany
Max Planck Institute for Informatics
Germany

Keywords

permutation graphs, Graph algorithms (graph-theoretic aspects), \(P_k\)-free graphs, split graphs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), interval graphs, firefighter problem

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	17
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%