Collision-free network exploration
From MaRDI portal
Publication:2396820
DOI10.1016/J.JCSS.2016.11.008zbMATH Open1370.68229OpenAlexW2563013149MaRDI QIDQ2396820FDOQ2396820
Ralf Klasing, Leszek Gąsieniec, Dariusz Dereniowski, Jurek Czyzowicz, Adrian Kosowski, Dominik Pajak
Publication date: 26 May 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00736276/file/collision-free-exploration.pdf
Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)
Cites Work
- Title not available (Why is that?)
- The theory of search games and rendezvous.
- An annotated bibliography on guaranteed graph searching
- Graph exploration by a finite automaton
- Matroids and the greedy algorithm
- The acquaintance time of (percolated) random geometric graphs
- Acquaintance time of random graphs near connectivity threshold
- Acquaintance Time of a Graph
- A tight upper bound on acquaintance time of graphs
- A note on the acquaintance time of random graphs
- Routing Permutations on Graphs via Matchings
- Exploring Unknown Environments
- Anonymous graph exploration without collision by mobile robots
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Exclusive Perpetual Ring Exploration without Chirality
- Many-to-many routing on trees via matchings
- Exploring Unknown Undirected Graphs
- Optimal Bounds for Matching Routing on Trees
- Collision-Free Network Exploration
This page was built for publication: Collision-free network exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396820)
