2 search results - page 1 / 1 » Compact Navigation and Distance Oracles for Graphs with Smal... |
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
CORR
2012
Springer
12 years 15 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...