Sciweavers

2 search results - page 1 / 1
» Surviving Rates of Graphs with Bounded Treewidth for the Fir...
Sort
View
SIAMDM
2010
119views more  SIAMDM 2010»
13 years 4 days 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
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 5 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap