✦ LIBER ✦

On a game of policemen and robber

✍ Scribed by M. Maamoun; H. Meyniel

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 136 KB
Volume: 17
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90034-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A game of cops and robbers

✍ M. Aigner; M. Fromme 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 632 KB

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

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

A remark on a helicopter and submarine g

A remark on a helicopter and submarine game

✍ Andrej Y U. Garnaev 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 350 KB 👁 1 views

The article considers a two-person zero-sum game in which the movement of the players is constrained to integer points . . . , -1, 0, 1, . . . of a line L. Initially the searcher (hider) is at point x = 0 (x = d, d > 0). The searcher and the hider perform simple motion on L with maximum speeds w and

A note on “a differential game of pursui

A note on “a differential game of pursuit and evasion”

✍ G. Leitmann 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 74 KB

Proof of a conjecture on game domination

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume