Pages that link to "Item:Q1837707"
From MaRDI portal
The following pages link to Vertex-to-vertex pursuit in a graph (Q1837707):
Displaying 50 items.
- A game theoretic analysis of the cops and robber game (Q258742) (← links)
- To catch a falling robber (Q265090) (← links)
- Cop vs. gambler (Q267177) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Simultaneously moving cops and robbers (Q306253) (← links)
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- Pursuit evasion on infinite graphs (Q343924) (← links)
- An evasion game on a graph (Q383337) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- The guarding game is E-complete (Q389949) (← links)
- Bucolic complexes (Q392957) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Foldings in graphs and relations with simplicial complexes and posets (Q442383) (← links)
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- The robber locating game (Q501037) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- The capture time of grids (Q616367) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Absolute reflexive retracts and absolute bipartite retracts (Q686243) (← links)
- Retracts of strong products of graphs (Q686295) (← links)
- An extension of a fixed point problem for simple graphs (Q686510) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Locating a robber on a graph (Q713142) (← links)
- Revolutionaries and spies (Q713165) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← 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)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- A game of cops and robbers (Q793755) (← links)
- Note on a pursuit game played on graphs (Q799702) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)