Algorithms - ESA 2003
From MaRDI portal
Publication:5897245
DOI10.1007/b13632zbMath1266.68143WikidataQ60299159 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
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences, Mobile Agent Rendezvous in a Ring Using Faulty Tokens, Black hole search in common interconnection networks, Deterministic symmetric rendezvous with tokens in a synchronous torus, Election and rendezvous with incomparable labels, Asynchronous deterministic rendezvous in graphs, Map construction of unknown graphs by multiple agents, Asynchronous Deterministic Rendezvous on the Line