Pages that link to "Item:Q897941"
From MaRDI portal
The following pages link to The complexity of zero-visibility cops and robber (Q897941):
Displayed 11 items.
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Computing the one-visibility copnumber of trees (Q2039691) (← links)
- One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- Limited visibility cops and robber (Q2185730) (← links)
- One-visibility cops and robber on trees (Q2232598) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- The one-visibility localization game (Q6073890) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)