Pages that link to "Item:Q2259861"

The following pages link to Cops and robbers is EXPTIME-complete (Q2259861):

Displaying 31 items.

• The guarding game is E-complete (Q389949) (← links)
• The game of Cops and Robber on circulant graphs (Q528556) (← links)
• Bounds on the length of a game of cops and robbers (Q724868) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• General cops and robbers games with randomness (Q820532) (← links)
• Cops and robber on butterflies and solid grids (Q831728) (← links)
• The complexity of zero-visibility cops and robber (Q897941) (← links)
• The lion and man game on polyhedral surfaces with obstacles (Q1643158) (← links)
• Cops and robbers on intersection graphs (Q1645059) (← links)
• Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
• Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
• The game of cops and eternal robbers (Q2034413) (← links)
• Approximate capture in Gromov-Hausdorff close spaces (Q2105711) (← links)
• A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
• A faster algorithm for cops and robbers (Q2166209) (← links)
• Cops that surround a robber (Q2197471) (← links)
• The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
• Zombie number of the Cartesian product of graphs (Q2217508) (← links)
• Hyperopic cops and robbers (Q2328865) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
• (Q3305770) (← links)
• Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
• An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
• Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
• Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
• (Q5136239) (← links)
• Conjectures on Cops and Robbers (Q5506774) (← links)
• Cops and robber on some families of oriented graphs (Q5896831) (← links)
• Variations of cops and robbers game on grids (Q5919113) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
• Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)