Efficient exploration of anonymous undirected graphs

DOI10.1007/978-3-642-45278-9_2MaRDI QIDQ2870012zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Memory Efficient Anonymous Graph Exploration
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
• scientific article; zbMATH DE number 5263405
• scientific article; zbMATH DE number 1303571

Cited in

(5)

• Anonymous graph exploration with binoculars
• Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
• Memory Efficient Anonymous Graph Exploration
• Algorithms – ESA 2005
• Derandomizing random walks in undirected graphs using locally fair exploration strategies

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)