๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A game of cops and robbers

โœ Scribed by M. Aigner; M. Fromme

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
632 KB
Volume
8
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A game of cops and robbers played on pro
A game of cops and robbers played on products of graphs
โœ S. Neufeld; R. Nowakowski ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 825 KB

The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem i

Variations on cops and robbers
Variations on cops and robbers
โœ Alan Frieze; Michael Krivelevich; Po-Shen Loh ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 215 KB

## Abstract We 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 t

On a game of policemen and robber
On a game of policemen and robber
โœ M. Maamoun; H. Meyniel ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB
Robbers, marshals, and guards: game theo
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
โœ Georg Gottlob; Nicola Leone; Francesco Scarcello ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 501 KB

In a previous paper (J. Comput. System Sci. 64 (2002) 519), the authors introduced the notion of hypertree decomposition and the corresponding concept of hypertree width and showed that the conjunctive queries whose hypergraphs have bounded hypertree width can be evaluated in polynomial time. Bounde