Pages that link to "Item:Q930895"
From MaRDI portal
The following pages link to An annotated bibliography on guaranteed graph searching (Q930895):
Displayed 50 items.
- A game theoretic analysis of the cops and robber game (Q258742) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Contraction obstructions for connected graph searching (Q298950) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- The guarding game is E-complete (Q389949) (← links)
- Fast searching games on graphs (Q411259) (← links)
- Edge search number of cographs (Q415273) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Exclusive graph searching (Q521823) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- Connected graph searching (Q690489) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Locating a robber on a graph (Q713142) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Directed elimination games (Q896668) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
- Cop-win graphs with maximum capture-time (Q968433) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- The capture time of a graph (Q1045043) (← links)
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem (Q1617399) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)