Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
From MaRDI portal
Publication:2934643
zbMATH Open1302.68220MaRDI QIDQ2934643FDOQ2934643
Publication date: 18 December 2014
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Artificial intelligence for robotics (68T40)
Cited In (19)
- Time versus space trade-offs for rendezvous in trees
- Deterministic polynomial approach in the plane
- Synchronous Rendezvous for Location-Aware Agents
- Fast rendezvous with advice
- How to meet in anonymous network
- Use of information, memory and randomization in asynchronous gathering
- Deterministic network exploration by a single agent with Byzantine tokens
- Price of asynchrony in mobile agents computing
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous in networks in spite of delay faults
- Title not available (Why is that?)
- Rendezvous Problem
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Leader election for anonymous asynchronous agents in arbitrary networks
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Asynchronous deterministic rendezvous in bounded terrains
- Title not available (Why is that?)
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
This page was built for publication: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934643)
