Sciweavers

14 search results - page 2 / 3
» Visibility Graphs, Dismantlability, and the Cops and Robbers...
Sort
View
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 6 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
WG
2009
Springer
14 years 5 months ago
Distance d-Domination Games
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
Stephan Kreutzer, Sebastian Ordyniak
TCS
2010
13 years 9 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
CAAN
2007
Springer
14 years 5 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
EJC
2007
13 years 10 months ago
Hypertree width and related hypergraph invariants
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Isolde Adler, Georg Gottlob, Martin Grohe