12 search results - page 3 / 3 » Faster Algorithms for Approximate Distance Oracles and All-P... |
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
JCSS
2011
12 years 11 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...