REVIEW
A faster algorithm for Cops and Robbers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A faster algorithm for Cops and Robbers
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})$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.