Approximate distance oracles with improved stretch for sparse graphs

Thorup and Zwick [1] introduced the notion of approximate distance oracles, a data structure that produces for an n-vertex, m-edge weighted undirected graph G=(V,E), distance estimations in constant query time. They presented a distance oracle of size O(kn1+1/k) that given a pair of vertices u,v∈V a...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 943; pp. 89 - 101
Main Authors:	Roditty, Liam, Tov, Roei
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 17.01.2023
Subjects:	Approximate distance oracles Approximate shortest paths Graph algorithms Approximate distance oracles Approximate shortest paths Graph algorithms
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!