STACS
2004
Springer
14 years 24 days ago
2004
Springer
Under the robot model, we show that a robot needs Ω(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorith...