Setting Port Numbers for Fast Graph Exploration
From MaRDI portal
Publication:3613644
DOI10.1007/11780823_6zbMath1222.68124OpenAlexW2173338545MaRDI QIDQ3613644
Publication date: 12 March 2009
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780823_6
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Memory Efficient Anonymous Graph Exploration ⋮ On the Power of Local Orientations ⋮ Fast periodic graph exploration with constant memory ⋮ Anonymous graph exploration without collision by mobile robots
This page was built for publication: Setting Port Numbers for Fast Graph Exploration
