✦ LIBER ✦

Cops and Robber Game Without Recharging

✍ Scribed by Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov

Book ID: 105915230
Publisher: Springer
Year: 2011
Tongue: English
Weight: 388 KB
Volume: 50
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-011-9360-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 witness version of the Cops and Robber

A witness version of the Cops and Robber game

✍ Nancy E. Clarke 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 602 KB

A note on -cop, -robber games on graphs

✍ Geňa Hahn; Gary MacGillivray 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The role of information in the cop-robbe

The role of information in the cop-robber game

✍ Volkan Isler; Nikhil Karnad 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 497 KB

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

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