✦ LIBER ✦

A search game on a cyclic graph

✍ Scribed by Kensaku Kikuta

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 122 KB
Volume: 51
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A search game on the union of graphs wit

A search game on the union of graphs with immobile hider

✍ Ljiljana Pavlović 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 623 KB

Some games of search on a lattice

✍ Noemi Zoroa Alonso; Procopio Zoroa Terol 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

A note concerning asymmetric games on gr

A note concerning asymmetric games on graphs

✍ Alvin E. Roth 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.

A search game with a protector

✍ V.J. Baston; A.Y. Garnaev 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is

A cooperative game in search theory

✍ Ryusuke Hohzaki 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

On a property of cyclic covers of p-grap

On a property of cyclic covers of p-graphs

✍ Themistocles Politof 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

A directed graph G with a source s and a sink r is called a p-graph if every edge of G belongs to an elementary (s,r)-path of G. If C is a cycle of the p-graph G then a cyclic cover of C is a set of (s,r)-paths of G that contains all the edges of C. A cyclic cover Q is minimal if for