# A faster algorithm for Cops and Robbers

arXiv: https://arxiv.org/abs/2112.07449 · HTML: https://mlsanity.com/paper/2112.07449/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Dec 2021.

## Built on by (most cited first, 1 of 1)

- [Predicting The Cop Number Using Machine Learning](https://mlsanity.com/paper/2602.16600/) (2026)

## Abstract (arXiv)

We present an algorithm of time complexity O(knk+2) deciding whether a graph G on n vertices is k-copwin. The fastest algorithm thus far had time complexity O(n2k+2).