Collision-free network exploration
From MaRDI portal
Recommendations
Cited in
(6)- The acquaintance time of (percolated) random geometric graphs
- Deterministic network exploration by anonymous silent agents with local traffic reports
- Contention resolution without collision detection
- Collision-free network exploration
- Networks based on collisions among mobile agents
- scientific article; zbMATH DE number 2036576 (Why is no real title available?)
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)