Cops and Robbers is EXPTIME-complete

被引：33
|
作者：
Kinnersley, William B. [1 ]
机构：
[1] Univ Rhode Isl, Dept Math, Kingston, RI 02881 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2015年 / 111卷
关键词：
Cops and robbers; EXPTIME-complete; Vertex-pursuit games; Moving target search; GRAPH; PURSUIT; GAMES;
D O I：
10.1016/j.jctb.2014.11.002
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We investigate the computational complexity of deciding whether k cops can capture a robber on a graph G. Goldstein and Reingold (1995) [8] conjectured that the problem is EXPTIME-complete when both G and k are part of the input; we prove this conjecture. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码：201 / 220
页数：20
相关论文
共 50 条
  • [1] QUIXO is EXPTIME-complete
    Mishiba, Shohei
    Takenaga, Yasuhiko
    INFORMATION PROCESSING LETTERS, 2020, 162
  • [2] THE HOM PROBLEM IS EXPTIME-COMPLETE
    Creus, Carles
    Gascon, Adria
    Godoy, Guillem
    Ramos, Lander
    SIAM JOURNAL ON COMPUTING, 2016, 45 (04) : 1230 - 1260
  • [3] GENCLO and TERMEQUIV are EXPTIME-complete
    Masulovic, Dragan
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2008, 18 (05) : 901 - 909
  • [4] Statistical EL is EXPTIME-complete
    Bednarczyk, Bartosz
    INFORMATION PROCESSING LETTERS, 2021, 169
  • [5] The HOM Problem is EXPTIME-Complete
    Creus, Carles
    Gascon, Adria
    Godoy, Guillem
    Ramos, Lander
    2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 255 - 264
  • [6] Ground reducibility is EXPTIME-complete
    Comon, H
    Jacquemard, F
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 26 - 34
  • [7] Ground reducibility is EXPTIME-complete
    Comon, H
    Jacquemard, F
    INFORMATION AND COMPUTATION, 2003, 187 (01) : 123 - 153
  • [8] ATL satisfiability is indeed ExpTime-complete
    Walther, Dirk
    Lutz, Carsten
    Wolter, Frank
    Wooldridge, Michael
    JOURNAL OF LOGIC AND COMPUTATION, 2006, 16 (06) : 765 - 787
  • [9] An EXPTIME-Complete Entailment Problem in Separation Logic
    Peltier, Nicolas
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2024, 2024, 14672 : 157 - 174
  • [10] 中国象棋属于EXPTIME-complete问题
    高强
    徐心和
    重庆理工大学学报(自然科学), 2014, 28 (08) : 85 - 91+131
12345