3 search results - page 1 / 1 » Faster Approximate Distance Queries and Compact Routing in S... |
CORR
2012
Springer
12 years 5 days ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
INFOCOM
2011
IEEE
12 years 7 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
PODC
2006
ACM
13 years 10 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...