Algorithms for Exploring an Unknown Graph

Abstract

We consider the problem of exploring an unknown strongly connected directed graph. We use the exploration model introduced by Deng and Papadimitriou [DP90]. An explorer follows the edges of an unknown graph until she has seen all the edges and vertices of the graph.