mlsanityData to 14 Oct 2026

A faster algorithm for Cops and Robbers

arXiv 2112.07449 ↗First posted 14 Dec 2021cs.DS math.COcited by 1

Not on the map. Why?

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).

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

  1. 2026Predicting The Cop Number Using Machine Learningcited by 0