Pathlength scaling in graphs with incomplete navigational information

2011. Physica A 390:3996-4001. The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigab

Read more