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.

• Type: Conference
• Year: 2004
• Where: ISAAC
• Authors: Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
• Keywords: Data Structure, Disjoint T-spanners, ISAAC 2004, Shortest Path Queries