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})$.
翻译:我们提出了一个时间复杂度的算法$O(kn ⁇ k+2}), 决定一个以美元为顶点的图表$G$是否是美元-copwin。 到目前为止,最快的算法是时间复杂度为$O(n ⁇ 2k+2}) 。