Approximate Distance Oracles for Graphs with Dense Clusters

15 years 10 months ago

Download www.win.tue.nl

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

Real-time Traffic

Data Structure | Disjoint T-spanners | ISAAC 2004 | Shortest Path Queries |

claim paper

» Distance Oracles for Sparse Graphs

» Fast and Compact Oracles for Approximate Distances in Planar Graphs

» Approximate distance oracles

» CKR Partitions of Sparse Graphs

» Approximate distance queries and compact routing in sparse graphs

» Approximate Shortest Paths Guided by a Small Index

» Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs

» Local Graph Partitions for Approximation and Testing

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	ISAAC
Authors	Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Comments (0)

Sciweavers

Approximate Distance Oracles for Graphs with Dense Clusters

Data Structure | Disjoint T-spanners | ISAAC 2004 | Shortest Path Queries |

Explore & Download

Productivity Tools

Sciweavers