Algorithms - ESA 2003
From MaRDI portal
Publication:5897245
DOI10.1007/b13632zbMath1266.68143OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897245
Andrzej Pelc, Pierre Fraigniaud, Anders Dessmark
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ Rendezvous Problem ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Faster Treasure Hunt and Better Strongly Universal Exploration Sequences ⋮ Election and rendezvous with incomparable labels ⋮ Map construction of unknown graphs by multiple agents ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences ⋮ Black hole search in common interconnection networks
This page was built for publication: Algorithms - ESA 2003
