A faster algorithm for Cops and Robbers
Reviewed by Pithpith:EBKSBSKMopen to challenge →
classification
cs.DS
math.CO
keywords
algorithmcomplexitytimecopscopwindecidingfasterfastest
read the original abstract
We present an algorithm of time complexity $O(kn^{k+2})$ deciding whether a graph $G$ on $n$ vertices is $k$-copwin. The fastest algorithm thus far had time complexity $O(n^{2k+2})$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.