Pages that link to "Item:Q930895"

The following pages link to An annotated bibliography on guaranteed graph searching (Q930895):

Displaying 50 items.

• On mobile agent verifiable problems (Q1753994) (← links)
• Linear search by a pair of distinct-speed robots (Q1755792) (← links)
• On some problems of guaranteed search on graphs (Q1759547) (← links)
• The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
• On some problems of guaranteed search (Q1922654) (← links)
• Locating a robber on a graph via distance queries (Q1929218) (← links)
• Approximate search strategies for weighted trees (Q1929222) (← links)
• \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
• Some remarks on cops and drunk robbers (Q1929226) (← links)
• On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
• Some game-theoretic remarks on two-player generalized cops and robbers games (Q2068910) (← links)
• A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I (Q2069711) (← links)
• Lions and contamination, triangular grids, and Cheeger constants (Q2080095) (← links)
• The localization capture time of a graph (Q2118876) (← links)
• A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
• Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
• A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
• Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
• Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
• CADbots: algorithmic aspects of manipulating programmable matter with finite automata (Q2223704) (← links)
• Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
• Cooperative exploration and protection of a workspace assisted by information networks (Q2248545) (← links)
• Pursuing a fast robber on a graph (Q2268876) (← links)
• Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
• Beachcombing on strips and islands (Q2285133) (← links)
• Hyperopic cops and robbers (Q2328865) (← links)
• Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
• Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
• Non-deterministic graph searching in trees (Q2344776) (← links)
• The searchlight problem for road networks (Q2354403) (← links)
• Distributed graph searching with a sense of direction (Q2355324) (← links)
• The cost of monotonicity in distributed graph searching (Q2377133) (← links)
• Collision-free network exploration (Q2396820) (← links)
• A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
• To satisfy impatient web surfers is hard (Q2437758) (← links)
• The theory of guaranteed search on graphs (Q2439841) (← links)
• Three-fast-searchable graphs (Q2446838) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
• Lions and contamination: monotone clearings (Q2678261) (← links)
• The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
• Fast searching on cactus graphs (Q2696935) (← links)
• Security and Formation of Network-Centric Operations (Q2790429) (← links)
• Meyniel's conjecture holds for random graphs (Q2795750) (← links)
• Pursuit of a moving target with known constant speed on a directed acyclic graph under partial information (Q2820184) (← links)
• Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
• On rerouting connection requests in networks with shared bandwidth (Q2839218) (← links)
• Variations on cops and robbers (Q2891049) (← links)
• Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
• Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
• Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)