34 search results - page 1 / 7 » The firefighter problem for cubic graphs |
DM
2010
13 years 5 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
SIAMDM
2010
12 years 11 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
JGAA
2007
13 years 4 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
ASIAN
1999
Springer
13 years 9 months ago
1999
Springer
