From the 1 of 6 linked papers with an AI index.
6 papers
Reproducing the k-copwin Algorithm: Theory vs. Implementation
Meagan Mann, Christian Muise, Erin Meger
The paper details a Python implementation of the 2022 k‑copwin algorithm for the Cops and Robbers game on graphs, clarifying its operation and assessing practical deployment consid…
Domain Design for the Cops and Robbers Problem
Connor Little, Meagan Mann, Erin Meger +1
Cops and Robbers is a well-studied problem in graph theory. The setting consists of a robber and one or more cops placed on an undirected graph. Taking turns moving throughout the…
Predicting The Cop Number Using Machine Learning
Meagan Mann, Christian Muise, Erin Meger
Cops and Robbers is a pursuit evasion game played on a graph, first introduced independently by Quilliot \cite{quilliot1978jeux} and Nowakowski and Winkler \cite{NOWAKOWSKI1983235}…
Improved bounds on the cop number when forbidding a minor
Franklin Kenter, Erin Meger, Jérémie Turcotte
Andreae (1986) proved that the cop number of connected -minor-free graphs is bounded for every graph . In particular, the cop number is at most if contains n…
Cops and Robbers on Graphs with Path Constraints
Alexander Clow, Erin Meger
In 2019, Sivaraman conjectured that every -free graph has cop number at most . In the same year, Liu proved this conjecture for -free graphs. Recently…
Zero Forcing on Iterated Graph Models
Christopher Brice, Erin Meger, Nhat-Dinh Nguyen +2
Modeling how information travels throughout a network has vast applications across social sciences, cybersecurity, and graph-based neural networks. In this paper, we consider the z…