Polynomial deterministic rendezvous in arbitrary graphs
From MaRDI portal
Recommendations
Cited in
(21)- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous in planar environments with obstacles and unknown initial distance
- Deterministic polynomial approach in the plane
- Asynchronous deterministic rendezvous in graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Asymptotically optimal deterministic rendezvous
- Rendezvous of mobile agents in directed graphs
- Asynchronous Deterministic Rendezvous on the Line
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Self-stabilizing rendezvous of synchronous mobile agents in graphs
- Deterministic Rendezvous in Restricted Graphs
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
- Deterministic rendezvous in graphs
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Uniform multi-agent deployment on a ring
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
This page was built for publication: Polynomial deterministic rendezvous in arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712153)
