The firefighter problem for graphs of maximum degree three
Copyright policy )The firefighter problem for graphs of maximum degree three
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Verona Italy
- University of Trento Italy
- University of Victoria Canada
- University of Victoria Canada
- University of Victoria Canada
Analysis of algorithms and problem complexity, Optimization on graphs, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, NP-complete problem, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Discrete Mathematics and Combinatorics, Firefigher problem, optimization on graphs, firefigher problem
Analysis of algorithms and problem complexity, Optimization on graphs, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, NP-complete problem, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Discrete Mathematics and Combinatorics, Firefigher problem, optimization on graphs, firefigher problem
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).85 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 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!