E-Book, Englisch, 362 Seiten
Bonato / Pralat Graph Searching Games and Probabilistic Methods
Erscheinungsjahr 2017
ISBN: 978-1-351-81477-5
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
E-Book, Englisch, 362 Seiten
Reihe: Discrete Mathematics and Its Applications
ISBN: 978-1-351-81477-5
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
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.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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