Sciweavers

Share
ISAAC
2004
Springer

Approximate Distance Oracles for Graphs with Dense Clusters

9 years 9 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answers (1 + ε)-approximate shortest path queries in G in constant time, where n is the number of vertices of G.
Mattias Andersson, Joachim Gudmundsson, Christos L
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where ISAAC
Authors Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Comments (0)
books