The author explores the problems of exploration and rendezvous for two agents in an unknown graph, providing algorithms that improve upon basic strategies like depth-first search.
