Sciweavers

SIAMDM
2010
119views more  SIAMDM 2010»
13 years 6 months ago
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
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 ...
Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou
DM
2008
110views more  DM 2008»
13 years 11 months ago
Nonrepetitive colorings of graphs of bounded tree-width
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
André Kündgen, Michael J. Pelsmajer
WG
2001
Springer
14 years 4 months ago
Approximation of Pathwidth of Outerplanar Graphs
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
Fedor V. Fomin, Hans L. Bodlaender