Results 1 to 10 of about 199 (175)
Cops and Robbers on Dynamic Graphs: Offline and Online Case [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model.
Stefan Balev +4 more
doaj +1 more source
Computing in Geometry and Topology, 2023 Equal to the published ...
Ha, Minh Tuan +3 more
+5 more sources
A Cop and Drunken Robber Game on n-Dimensional Infinite-Grid Graphs
Mathematics, 2021 A Cop and Drunken Robber (CDR) game is one variation of a famous combinatorial game, called Cops and Robbers, which has been extensively studied and applied in the area of theoretical and computer science as demonstrated by several conferences and ...
Nuttanon Songsuwan +3 more
doaj +1 more source
A Note on Some Weaker Notions of Cop-Win and Robber-Win Graphs
Mathematics, 2022 The game of pursuit and evasion, when played on graphs, is often referred to as the game of cops and robbers. This classical version of the game has been completely solved by Nowakowski and Winkler, who gave the exact class of graphs for which the ...
Shravan Luckraz +2 more
doaj +1 more source
Hyperopic Cops and Robbers [PDF]
Theoretical Computer Science, 2019 We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter.
Bonato, Anthony +5 more
openaire +4 more sources
Capture-Time Extremal Cop-Win Graphs
Discussiones Mathematicae Graph Theory, 2021 We investigate extremal graphs related to the game of Cops and Robbers. We focus on graphs where a single cop can catch the robber; such graphs are called cop-win.
Offner David, Ojakian Kerry
doaj +1 more source
Tree-width for first order formulae [PDF]
Logical Methods in Computer Science, 2012 We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed parameter tractable ...
Isolde Adler, Mark Weyer
doaj +1 more source
Limited visibility Cops and Robber
Discrete Applied Mathematics, 2020 We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter $\ell$. We consider the basic consequences of this definition for some simple graph families, and show that this model is not monotonic, unlike common models where the robber is invisible.
Clarke, N. E. +5 more
openaire +2 more sources
Variations on cops and robbers [PDF]
Journal of Graph Theory, 2011 AbstractWe consider several variants of the classical Cops and Robbers game. We treat the version where the robber can move R≥1 edges at a time, establishing a general upper bound of , where α = 1 + 1/R, thus generalizing the best known upper bound for the classical case R = 1 due to Lu and Peng, and Scott and Sudakov.
Frieze, Alan +2 more
openaire +2 more sources
General Cops and Robbers games with randomness [PDF]
Theoretical Computer Science, 2021 36 pages, submitted to the journal Theoretical Computer ...
Simard, Frédéric +2 more
openaire +2 more sources