The reviewed record of science sign in
Pith

arxiv: 2112.07449 · v2 · pith:EBKSBSKM · submitted 2021-12-14 · cs.DS · math.CO

A faster algorithm for Cops and Robbers

Jan Petr , Julien Portier , Leo Versteegen This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EBKSBSKMrecord.jsonopen to challenge →

classification cs.DS math.CO
keywords algorithmcomplexitytimecopscopwindecidingfasterfastest
0
0 comments X
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.