Pathlength scaling in graphs with incomplete navigational information

► We investigate how agents can find their ways in a graph with incomplete information. ► Increasing the information to on a graph can effectively improve the algorithm. ► Additional geometric information from graph layout programs helps the navigation.