Fine-grained Lower Bounds on Cops and Robbers
ESA, pp. 9:1-9:12, 2018.
EI
摘要：
Cops and Robbers is a classic pursuit-evasion game played between a group of g cops and one robber on an undirected N-vertex graph G. We prove that the complexity of deciding the winner in the game under optimal play requires Omega (N^{g-o(1)}) time on instances with O(N log^2 N) edges, conditioned on the Strong Exponential Time Hypothesi...更多
代码：
数据：
标签
评论