Pages that link to "Item:Q930895"
From MaRDI portal
The following pages link to An annotated bibliography on guaranteed graph searching (Q930895):
Displaying 32 items.
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Constructing Brambles (Q3182927) (← links)
- Revolutionaries and Spies on Random Graphs (Q4921570) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Game with Slow Pursuers on the Edge Graphs of Regular Simplexes (Q5057950) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- Differential Game with Slow Pursuers on the Edge Graph of a Simplex (Q5072237) (← links)
- (Q5089244) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- (Q5874536) (← links)
- A Combinatorial Model of Two-Sided Search (Q5895055) (← links)
- Vision-Based Pursuit-Evasion in a Grid (Q5900155) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
- Vertex-edge domination in graphs (Q5919557) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Fast searching on \(k\)-combinable graphs (Q6111627) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- Forming tile shapes with simple robots (Q6151177) (← links)
- (Q6165487) (← links)
- The localization number of designs (Q6188118) (← links)
- Constrained graph searching on trees (Q6535820) (← links)
- A graph searching game for block treedepth and a cubic kernel by vertex cover (Q6590085) (← links)
- A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)
- Optimal number of pursuers in the game on the 1-skeleton of 4D cube (Q6599332) (← links)
