Linguistic geometry approach for solving the cops and robber problem in grid environments
From MaRDI portal
Publication:778399
Recommendations
Cites work
- scientific article; zbMATH DE number 1665333 (Why is no real title available?)
- scientific article; zbMATH DE number 5241699 (Why is no real title available?)
- scientific article; zbMATH DE number 2238822 (Why is no real title available?)
- A cops and robber game in multidimensional grids
- A game of cops and robbers
- A linguistic approach to geometric reasoning
- A note on \(k\)-cop, \(l\)-robber games on graphs
- A simple method of computing the catch time
- An analysis of alpha-beta pruning
- Cops and robber game without recharging
- Edge-critical cops and robber in planar graphs
- Lazy cops and robbers on hypercubes
- Linguistic geometry. From search to construction
- On the cop number of a graph
- Pursuing a fast robber on a graph
- Pursuit-evasion in models of complex networks
- Searching and sweeping graphs: a brief survey
- The capture time of a graph
- The capture time of grids
- The complexity of pursuit on a graph
- The game of cops and robbers on graphs
- The optimal capture time of the one-cop-moves game
- Translations of network languages
- Variations of cops and robber on the hypercube
- Vertex-to-vertex pursuit in a graph
- Vision-based pursuit-evasion in a grid
This page was built for publication: Linguistic geometry approach for solving the cops and robber problem in grid environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778399)