Cooperative exploration and protection of a workspace assisted by information networks
From MaRDI portal
Publication:2248545
Recommendations
Cites work
- An annotated bibliography on guaranteed graph searching
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Graph searching and a min-max theorem for tree-width
- Graph searching in a crime wave
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- Nondeterministic graph searching: from pathwidth to treewidth
- On minimizing width in linear layouts
- Planning Algorithms
- Recontamination does not help to search a graph
- The complexity of searching a graph
This page was built for publication: Cooperative exploration and protection of a workspace assisted by information networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248545)