TY - GEN

T1 - Distance oracles for vertex-labeled graphs

AU - Hermelin, Danny

AU - Levy, Avivit

AU - Weimann, Oren

AU - Yuster, Raphael

PY - 2011

Y1 - 2011

N2 - Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1,...,λℓ}, we construct a compact distance oracle that answers queries of the form: "What is δ(ν,λ)?", where ν ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(ν,λ) is the distance (length of a shortest path) between ν and the closest vertex labeled λ in G. We formalize this natural problem and provide a hierarchy of approximate distance oracles that require subquadratic space and return a distance of constant stretch. We also extend our solution to dynamic oracles that handle label changes in sublinear time.

AB - Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1,...,λℓ}, we construct a compact distance oracle that answers queries of the form: "What is δ(ν,λ)?", where ν ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(ν,λ) is the distance (length of a shortest path) between ν and the closest vertex labeled λ in G. We formalize this natural problem and provide a hierarchy of approximate distance oracles that require subquadratic space and return a distance of constant stretch. We also extend our solution to dynamic oracles that handle label changes in sublinear time.

UR - http://www.scopus.com/inward/record.url?scp=79960016401&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22012-8_39

DO - 10.1007/978-3-642-22012-8_39

M3 - Conference contribution

AN - SCOPUS:79960016401

SN - 9783642220111

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 490

EP - 501

BT - Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings

T2 - 38th International Colloquium on Automata, Languages and Programming, ICALP 2011

Y2 - 4 July 2011 through 8 July 2011

ER -