On-line search in two-dimensional environment
From MaRDI portal
Publication:5919296
DOI10.1007/s00224-019-09948-6zbMath1436.68404arXiv1610.01458OpenAlexW2528224389MaRDI QIDQ5919296
Dorota Osula, Dariusz Dereniowski
Publication date: 19 December 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.01458
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Positional games (pursuit and evasion, etc.) (91A24) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Contraction obstructions for connected graph searching
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Performance modeling of Cartesian product networks
- Connected graph searching
- Connected searching of weighted trees
- Network decontamination under \(m\)-immunity
- An annotated bibliography on guaranteed graph searching
- Distributed chasing of network intruders
- Graph searching with advice
- Sweeping graphs with large clique number
- Approximate search strategies for weighted trees
- Distributed graph searching with a sense of direction
- The cost of monotonicity in distributed graph searching
- Lower bounds on the pathwidth of some grid-like graphs
- Exclusive Graph Searching
- Decontamination of hypercubes by mobile agents
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Tree Decontamination with Temporary Immunity
- The complexity of searching a graph
- From Pathwidth to Connected Pathwidth
- Optimal Network Decontamination with Threshold Immunity
- Network Decontamination with Temporal Immunity by Cellular Automata
- Oracle size
- Recontamination does not help to search a graph
This page was built for publication: On-line search in two-dimensional environment
