Exploring an Unknown Graph (Extended Abstract)


We wish to explore all edges of an unknown directed, strongly connected graph. At each point we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited (but we cannot tell where each leads until we follow it). We wish to… (More)
DOI: 10.1109/FSCS.1990.89554


10 Figures and Tables

Slides referencing similar topics