Distance oracles for vertex-labeled graphs

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings
Pages490-501
Number of pages12
EditionPART 2
DOIs
StatePublished - 2011
Event38th International Colloquium on Automata, Languages and Programming, ICALP 2011 - Zurich, Switzerland
Duration: 4 Jul 20118 Jul 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6756 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference38th International Colloquium on Automata, Languages and Programming, ICALP 2011
Country/TerritorySwitzerland
CityZurich
Period4/07/118/07/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Distance oracles for vertex-labeled graphs'. Together they form a unique fingerprint.

Cite this