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