Searching by heterogeneous agents
DOI10.1016/j.jcss.2020.06.008zbMath1464.68282arXiv2105.02609OpenAlexW3043568488MaRDI QIDQ5918998
Dariusz Dereniowski, Robert Ostrowski, Łukasz Kuszner
Publication date: 23 October 2020
Published in: Journal of Computer and System Sciences, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.02609
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exclusive graph searching
- Connected graph searching
- Connected searching of weighted trees
- Exclusive graph searching vs. pathwidth
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- The complexity of zero-visibility cops and robber
- Parallel cleaning of a network with brushes
- Maximum vertex occupation time and inert fugitive: Recontamination does help
- Monotony properties of connected visible graph searching
- Sweeping graphs with large clique number
- On the monotonicity of games generated by symmetric submodular functions.
- Graph searching, elimination trees, and a generalization of bandwidth
- Approximate search strategies for weighted trees
- Deterministic rendezvous with different maps
- Non-deterministic graph searching in trees
- Fence patrolling by mobile agents with distinct speeds
- The cost of monotonicity in distributed graph searching
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Searching Trees with Sources and Targets
- On the Fast Searching Problem
- The complexity of searching a graph
- Monotonicity in graph searching
- From Pathwidth to Connected Pathwidth
- Recontamination does not help to search a graph
- Pathwidth is NP-Hard for Weighted Trees
- Patrolling by Robots Equipped with Visibility
This page was built for publication: Searching by heterogeneous agents
