Efficient Exploration of Anonymous Undirected Graphs

DOI10.1007/978-3-642-45278-9_2zbMATH Open1407.68364OpenAlexW2215184736MaRDI QIDQ2870012

Ralf Klasing

Publication date: 17 January 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (2)

Memory Efficient Anonymous Graph Exploration ⋮ Algorithms – ESA 2005

This page was built for publication: Efficient Exploration of Anonymous Undirected Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870012)