Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68588OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716786

Amos Korman, Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, David Peleg

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

Proof labeling schemes ⋮ Distributed computing with advice: information sensitivity of graph coloring ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Graph Decomposition for Improving Memoryless Periodic Exploration ⋮ The ANTS problem ⋮ Local MST computation with short advice ⋮ Graph decomposition for memoryless periodic exploration ⋮ Drawing maps with advice ⋮ Toward more localized local algorithms: removing assumptions concerning global knowledge ⋮ Distributed chasing of network intruders ⋮ Fast periodic graph exploration with constant memory ⋮ Setting port numbers for fast graph exploration ⋮ Online computation with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Labeling schemes for tree representation ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Black Hole Search in Directed Graphs ⋮ Distributed graph searching with a sense of direction

This page was built for publication: Automata, Languages and Programming