Parameterized complexity of firefighting
Copyright policy )Parameterized complexity of firefighting
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Paris Dauphine University France
- Charles Darwin University Australia
- Institut Universitaire de France France
- University of Warsaw Poland
- University of Bergen Norway
Analysis of algorithms and problem complexity, firefighter problem, Probabilités et mathématiques appliquées, 004, 519, fixed parameter tractability, Graph theory (including graph drawing) in computer science, Firefighter problem, kernelization, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Bipartite graphs
Analysis of algorithms and problem complexity, firefighter problem, Probabilités et mathématiques appliquées, 004, 519, fixed parameter tractability, Graph theory (including graph drawing) in computer science, Firefighter problem, kernelization, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Bipartite graphs
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).18 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%
Citations provided by BIP!Popularity provided by BIP!