Results 11 to 20 of about 199 (175)
Cops and Robbers on intersection graphs [PDF]
European Journal of Combinatorics, 2018 The cop number of a graph $G$ is the smallest $k$ such that $k$ cops win the game of cops and robber on $G$. We investigate the maximum cop number of geometric intersection graphs, which are graphs whose vertices are represented by geometric shapes and edges by their intersections.
Tomáš Gavenčiak +4 more
openaire +2 more sources
Cops and Robber Game Without Recharging [PDF]
Theory of Computing Systems, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fomin, Fedor V. +2 more
openaire +2 more sources
PERCEPTIONS OF SERVICE-ORIENTATION AND TRUST OF TAX OFFICERS BETWEEN MILLENIALS, X, AND BABY BOOMERS
MIX: Jurnal Ilmiah Manajemen, 2019 The purpose of this study is to examine differences in perceptions of generations related to service-orientation and trust to tax officers. Changes traditional paradigm of the relationship between tax officers and taxpayers from “cops and robbers” to ...
Elisa Tjondro +2 more
doaj +1 more source
Lazy Cops and Robbers on Hypercubes [PDF]
Combinatorics, Probability and Computing, 2015 We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy ...
Bal, Deepak +3 more
openaire +2 more sources
Cop and Robber Game and Hyperbolicity [PDF]
SIAM Journal on Discrete Mathematics, 2014 In this note, we prove that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s' with s'0, this establishes a new - game-theoretical - characterization of Gromov hyperbolicity. We also show that for weakly modular graphs the dependency between and s is linear for any s'
Chalopin, Jérémie +3 more
openaire +2 more sources
Cops and Robbers on Geometric Graphs [PDF]
Combinatorics, Probability and Computing, 2012 Cops and robbers is a turn-based pursuit game played on a graph G. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number c(G) denotes the minimum number of cops required to catch the robber in finite time. We study the cop number of geometric graphs.
Beveridge, Andrew +3 more
openaire +3 more sources
, 2021 Wall Cops and Robbers is a new turn-based game played on graphs. It is inspired by the games of Cops and Robbers and the Angel Problem. The objective of the game is for the cops to capture the robber by surrounding him with walls. The wall cop number of a graph G, written Wc(G), is the least number of cops it takes to capture the robber in G.
openaire +1 more source
Traders, Cops and Robbers [PDF]
, 2003 Why does illegal trade often flourish without formal enforcement, but sometimes fail? Why do illegal trade-reducing policies often fail? Why do States often appear to tolerate illegal trade? A model of trade with cops and robbers provides answers. `Safety in numbers' is a key element: the equilibrium probability of successful shipments is increasing in
openaire +2 more sources
Cops and Robber with Constraints [PDF]
SIAM Journal on Discrete Mathematics, 2012 Cops and robber is a classical pursuit-evasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this paper, we investigate the changes in problem's complexity and combinatorial properties with constraining the following natural game parameters: fuel, the number of steps each cop can ...
Fedor V. Fomin +2 more
openaire +1 more source