Pages that link to "Item:Q1945941"
From MaRDI portal
The following pages link to On the computational complexity of a game of cops and robbers (Q1945941):
Displaying 9 items.
- The guarding game is E-complete (Q389949) (← 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)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- (Q3305770) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
