Collision-free network exploration

DOI10.1016/J.JCSS.2016.11.008MaRDI QIDQ2396820zbMATHOpenAlexFDO

Authors Dariusz Dereniowski, Leszek Gąsieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak, Jurek Czyzowicz

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

zbMATH Keywords

mobile agentsnetwork explorationsynchronous agents

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Recommendations

• Collision-free network exploration
• Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
• Deterministic network exploration by anonymous silent agents with local traffic reports
• Fast collaborative graph exploration
• Collective tree exploration

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on the acquaintance time of random graphs
• A tight upper bound on acquaintance time of graphs
• Acquaintance time of a graph
• Acquaintance time of random graphs near connectivity threshold
• An annotated bibliography on guaranteed graph searching
• Anonymous graph exploration without collision by mobile robots
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Collision-free network exploration
• Exclusive perpetual ring exploration without chirality
• Exploring Unknown Environments
• Exploring Unknown Undirected Graphs
• Graph exploration by a finite automaton
• Many-to-many routing on trees via matchings
• Matroids and the greedy algorithm
• Optimal Bounds for Matching Routing on Trees
• Routing Permutations on Graphs via Matchings
• The acquaintance time of (percolated) random geometric graphs
• The theory of search games and rendezvous.

Cited in

(4)

• Deterministic network exploration by anonymous silent agents with local traffic reports
• scientific article; zbMATH DE number 2036576 (Why is no real title available?)
• Networks based on collisions among mobile agents
• 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)