We show that the firefighter problem is NP-complete for trees of maximum degree three, but in P for graphs of maximum degree three if the fire breaks out at a vertex of degree at most two
LNCS n°7074In this paper we study the parameterized complexity of the firefighter problem. More prec...
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a p...
Abstract. In this paper, we consider the firefighter problem on a graph G = (V,E) that is either fin...
AbstractWe show that the firefighter problem is NP-complete for trees of maximum degree three, but i...
AbstractWe show that the firefighter problem is NP-complete for cubic graphs. We also show that give...
In this paper we study the complexity of generalized versions of the firefighter problem on trees, a...
he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. A...
The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with k...
The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G....
TheFirefighterproblem is to place firefighters on the vertices ofa graph to prevent a fire with know...
It is well known that fighting a fire is a hard task. The Firefighter problem asks how to optimally ...
AbstractThe firefighter problem is a simplified model for the spread of a fire (or disease or comput...
Abstract. The Firefighter Problem is a simplified model for the spread of a fire (or disease or comp...
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is...
Abstract. The Firefighter Problem is a simplified model for the spread of a fire (or disease or comp...
LNCS n°7074In this paper we study the parameterized complexity of the firefighter problem. More prec...
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a p...
Abstract. In this paper, we consider the firefighter problem on a graph G = (V,E) that is either fin...
AbstractWe show that the firefighter problem is NP-complete for trees of maximum degree three, but i...
AbstractWe show that the firefighter problem is NP-complete for cubic graphs. We also show that give...
In this paper we study the complexity of generalized versions of the firefighter problem on trees, a...
he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. A...
The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with k...
The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G....
TheFirefighterproblem is to place firefighters on the vertices ofa graph to prevent a fire with know...
It is well known that fighting a fire is a hard task. The Firefighter problem asks how to optimally ...
AbstractThe firefighter problem is a simplified model for the spread of a fire (or disease or comput...
Abstract. The Firefighter Problem is a simplified model for the spread of a fire (or disease or comp...
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is...
Abstract. The Firefighter Problem is a simplified model for the spread of a fire (or disease or comp...
LNCS n°7074In this paper we study the parameterized complexity of the firefighter problem. More prec...
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a p...
Abstract. In this paper, we consider the firefighter problem on a graph G = (V,E) that is either fin...
DOI
Add to ORKG