Collision-free network exploration

DOI10.1007/978-3-642-54423-1_30MaRDI QIDQ5405053zbMATH OpenOpenAlexFDO

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

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00736276/file/collision-free-exploration.pdf

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
• Collective tree exploration
• LATIN 2004: Theoretical Informatics

Cited in

(6)

• The acquaintance time of (percolated) random geometric graphs
• Collision-free network exploration
• Deterministic network exploration by anonymous silent agents with local traffic reports
• scientific article; zbMATH DE number 2036576 (Why is no real title available?)
• Contention resolution without collision detection
• Networks based on collisions among mobile agents

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 Q5405053)