Vertex-to-vertex pursuit in a graph
From MaRDI portal
Publication:1837707
DOI10.1016/0012-365X(83)90160-7zbMath0508.05058WikidataQ64116772 ScholiaQ64116772MaRDI QIDQ1837707
Richard J. Nowakowski, Peter M. Winkler
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (only showing first 100 items - show all)
To catch a falling robber ⋮ Cop vs. gambler ⋮ General cops and robbers games with randomness ⋮ Dismantlable graphs and posets, fixed clique property ⋮ Cops and robber on butterflies and solid grids ⋮ Localization game on geometric and planar graphs ⋮ Isometric-path numbers of block graphs ⋮ Absolute retracts of split graphs ⋮ The capture time of a planar graph ⋮ Data center interconnection networks are not hyperbolic ⋮ Cops and robbers in graphs with large girth and Cayley graphs ⋮ A fixed cube theorem for median graphs ⋮ Simultaneously moving cops and robbers ⋮ A Helly theorem for geodesic convexity in strongly dismantlable graphs ⋮ A deterministic version of the game of zombies and survivors on graphs ⋮ The lion and man game on polyhedral surfaces with obstacles ⋮ On a pursuit game played on graphs for which a minor is excluded ⋮ Cops and robbers on intersection graphs ⋮ Powers of distance-hereditary graphs ⋮ On bridged graphs and cop-win graphs ⋮ Pursuit evasion on infinite graphs ⋮ How many lions are needed to clear a grid? ⋮ Simplicial decompositions of graphs: A survey of applications ⋮ Dismantling absolute retracts of reflexive graphs ⋮ A cops and robber game in multidimensional grids ⋮ Cops and robbers from a distance ⋮ Parameterized pursuit-evasion games ⋮ A Helly theorem in weakly modular space ⋮ An evasion game on a graph ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ The guarding game is E-complete ⋮ Revolutionaries and spies: spy-good and spy-bad graphs ⋮ Locating a robber on a graph via distance queries ⋮ Some remarks on cops and drunk robbers ⋮ Cops and Robber game with a fast robber on expander graphs and random graphs ⋮ Bucolic complexes ⋮ The capture time of grids ⋮ On a characterization of evasion strategies for pursuit-evasion games on graphs ⋮ Cop-robber guarding game with cycle robber-region ⋮ Capturing the drunk robber on a graph ⋮ How to hunt an invisible rabbit on a graph ⋮ Mixing properties for hom-shifts and the distance between walks on associated graphs ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ The complexity of zero-visibility cops and robber ⋮ Arboricity, \(h\)-index, and dynamic algorithms ⋮ Almost all cop-win graphs contain a universal vertex ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ The capture time of the hypercube ⋮ The impact of loops on the game of cops and robbers on graphs ⋮ Guard games on graphs: keep the intruder out! ⋮ How to guard a graph? ⋮ Recognizing quasi-triangulated graphs. ⋮ Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) ⋮ The role of information in the cop-robber game ⋮ Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning ⋮ An annotated bibliography on guaranteed graph searching ⋮ The fast robber on interval and chordal graphs ⋮ Cops and Robbers on diameter two graphs ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ The complexity of pursuit on a graph ⋮ The robber locating game ⋮ Cops and robbers ordinals of cop-win trees ⋮ Spy-game on graphs: complexity and simple topologies ⋮ The median game ⋮ On distance-preserving elimination orderings in graphs: complexity and algorithms ⋮ Absolute reflexive retracts and absolute bipartite retracts ⋮ Retracts of strong products of graphs ⋮ An extension of a fixed point problem for simple graphs ⋮ Some pursuit-evasion problems on grids ⋮ Lazy Cops and Robbers on generalized hypercubes ⋮ The game of Cops and Robber on circulant graphs ⋮ Selfish cops and passive robber: qualitative games ⋮ Cops and robber game without recharging ⋮ Search and sweep numbers of finite directed acyclic graphs ⋮ Cop-win graphs with maximum capture-time ⋮ A graph search algorithm for indoor pursuit/evasion ⋮ Locating a robber on a graph ⋮ Revolutionaries and spies ⋮ The clique operator on circular-arc graphs ⋮ A dynamic location problem for graphs ⋮ Bounds for cops and robber pursuit ⋮ On sabotage games ⋮ Safe navigation in adversarial environments ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Some results about pursuit games on metric spaces obtained through graph theory techniques ⋮ Gibbs measures and dismantlable graphs ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ Algorithms for the fixed point property ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ The capture time of a graph ⋮ The smallest graph variety containing all paths ⋮ A game of cops and robbers played on products of graphs ⋮ A game of cops and robbers ⋮ Note on a pursuit game played on graphs ⋮ Clique graphs and Helly graphs ⋮ A short note about pursuit games played on a graph with a given genus ⋮ A game theoretic analysis of the cops and robber game
Cites Work
This page was built for publication: Vertex-to-vertex pursuit in a graph
