A faster algorithm for Cops and Robbers
Data Structures and Algorithms
2022-06-16 v2 Combinatorics
Abstract
We present an algorithm of time complexity deciding whether a graph on vertices is -copwin. The fastest algorithm thus far had time complexity .
Keywords
Cite
@article{arxiv.2112.07449,
title = {A faster algorithm for Cops and Robbers},
author = {Jan Petr and Julien Portier and Leo Versteegen},
journal= {arXiv preprint arXiv:2112.07449},
year = {2022}
}