A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Graph Exploration Problem with Advice
[article]

2018
*
arXiv
*
pre-print

Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last decades and was analyzed in many different settings. The graph exploration problem is a theoretical and abstract model, where an algorithm has to decide how the agent, also called explorer, moves through a network such that every point of interest is visited at least once. For its decisions, the knowledge of the

arXiv:1804.06675v1
fatcat:dxdwhf7llfbbhgfu3apbcciuva