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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 943; s. 89 - 101
Hlavní autori:	Roditty, Liam, Tov, Roei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 17.01.2023
Predmet:	Approximate distance oracles Approximate shortest paths Graph algorithms Approximate distance oracles Approximate shortest paths Graph algorithms
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!