Pages that link to "Item:Q3569897"
From MaRDI portal
The following pages link to Cops and Robber Game without Recharging (Q3569897):
Displaying 19 items.
- To catch a falling robber (Q265090) (← links)
- Simultaneously moving cops and robbers (Q306253) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- On the computational complexity of a game of cops and robbers (Q1945941) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← 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)
- Cops and an insightful robber (Q2661223) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Cops and robber with constraints (Q2910936) (← links)
- (Q3798505) (← links)