Graph searching games and probabilistic methods
著者
書誌事項
Graph searching games and probabilistic methods
（Discrete mathematics and its applications / Kenneth H. Rosen, series editor）
CRC Press, c2018
- : hardback
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"A Chapman & Hall book"
Includes bibliographical references (p. 357-374) and index
内容説明・目次
内容説明
Graph Searching Games and Probabilistic Methods is the first book that focuses on the intersection of graph searching games and probabilistic methods. The book explores various applications of these powerful mathematical tools to games and processes such as Cops and Robbers, Zombie and Survivors, and Firefighting.
Written in an engaging style, the book is accessible to a wide audience including mathematicians and computer scientists. Readers will find that the book provides state-of-the-art results, techniques, and directions in graph searching games, especially from the point of view of probabilistic methods.
The authors describe three directions while providing numerous examples, which include:
* Playing a deterministic game on a random board.
* Players making random moves.
* Probabilistic methods used to analyze a deterministic game.
目次
- Preface
- Chapter 1: Introduction
- 2: The Game of Cops and Robbers
- 3. Variations of Cops and Robbers
- 4. Large Cop Number and Meyniel's Conjecture
- 5. Graph Cleaning
- 6. Acquaintance Time
- 7. Random Geometric Graphs
- 8. Firefighting and Seepage
- 9. Miscellaneous Topics
- Bibliography
- Index
「Nielsen BookData」 より
