A faster algorithm for Cops and Robbers
share
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).
READ FULL TEXTWe 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).
READ FULL TEXT