Mathematical Foundations of Computer Science 2004

DOI10.1007/B99679zbMath1096.68080OpenAlexW2488008928MaRDI QIDQ5311120

Pierre Fraigniaud, Guy Peer, Andrzej Pelc, David Ilcinkas, David Peleg

Publication date: 22 August 2005

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Setting port numbers for fast graph exploration ⋮ Impact of memory size on graph exploration capability ⋮ Graph exploration by a finite automaton

This page was built for publication: Mathematical Foundations of Computer Science 2004