Exclusive Graph Searching
From MaRDI portal
Publication:2849309
DOI10.1007/978-3-642-40450-4_16zbMath1364.68303OpenAlexW115687286MaRDI QIDQ2849309
Nicolas Nisse, Lélia Blin, Janna Burman
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_16
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
On the Cooperative Graph Searching Problem ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Exclusive graph searching ⋮ Gathering on rings under the look-compute-move model ⋮ On-line search in two-dimensional environment ⋮ Exclusive graph searching vs. pathwidth
This page was built for publication: Exclusive Graph Searching
