Pages that link to "Item:Q692888"
From MaRDI portal
The following pages link to Cops and robber game without recharging (Q692888):
Displaying 28 items.
- A game theoretic analysis of the cops and robber game (Q258742) (← links)
- To catch a falling robber (Q265090) (← links)
- Simultaneously moving cops and robbers (Q306253) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- Improved bounds for cops-and-robber pursuit (Q634246) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- On a game of policemen and robber (Q1820799) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- On the computational complexity of a game of cops and robbers (Q1945941) (← links)
- Cops, robbers, and burning bridges (Q2041705) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Chasing a drunk robber in many classes of graphs (Q2105709) (← links)
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Selfish cops and active robber: multi-player pursuit evasion on graphs (Q2420619) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Cops and an insightful robber (Q2661223) (← links)
- Cops, robber and traps (Q2770438) (← links)
- Cops and robber with constraints (Q2910936) (← links)
- Cops and Robber Game without Recharging (Q3569897) (← links)
- (Q3798505) (← links)