A faster algorithm for Cops and Robbers
Abstract
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).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.