Automata, Languages and Programming
From MaRDI portal
Publication:5716786
DOI10.1007/11523468zbMath1082.68588WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716786
David Peleg, David Ilcinkas, Pierre Fraigniaud, Amos Korman, Reuven Cohen
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
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
Memory Efficient Anonymous Graph Exploration, Drawing maps with advice, Online computation with advice, Trade-offs between the size of advice and broadcasting time in trees, Local MST computation with short advice, Distributed chasing of network intruders, Fast periodic graph exploration with constant memory, Setting port numbers for fast graph exploration, Labeling schemes for tree representation, Distributed graph searching with a sense of direction, Proof labeling schemes, Distributed computing with advice: information sensitivity of graph coloring, Graph decomposition for memoryless periodic exploration, Toward more localized local algorithms: removing assumptions concerning global knowledge, Graph Decomposition for Improving Memoryless Periodic Exploration, More Efficient Periodic Traversal in Anonymous Undirected Graphs, Black Hole Search in Directed Graphs