Publication:2934643
From MaRDI portal
zbMath1302.68220MaRDI QIDQ2934643
Publication date: 18 December 2014
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
68T40: Artificial intelligence for robotics
Related Items
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences, Unnamed Item, Deterministic network exploration by a single agent with Byzantine tokens, Asynchronous deterministic rendezvous in bounded terrains, Fast rendezvous with advice, Rendezvous of heterogeneous mobile agents in edge-weighted networks, How to meet in anonymous network, Use of information, memory and randomization in asynchronous gathering, How to meet when you forget: log-space rendezvous in arbitrary graphs, Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains, Leader election for anonymous asynchronous agents in arbitrary networks, Time versus space trade-offs for rendezvous in trees, Deterministic polynomial approach in the plane, Rendezvous in networks in spite of delay faults, Price of asynchrony in mobile agents computing, Rendezvous Problem, Synchronous Rendezvous for Location-Aware Agents