Labeling schemes with queries

Amos Korman, Shay Kutten

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


Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any two vertices u and v for some function f (e.g. "distance(u, v)") one can compute the function (e.g. the graph distance between u and v). Some very involved lower bounds for the sizes of the labels were proven. In this paper, we demonstrate that such lower bounds are very sensitive to the number of vertices consulted. That is, we show several almost trivial constructions of such labeling schemes that beat the lower bounds by large margins. The catch is that one needs to consult the labels of three vertices instead of two. We term our generalized model labeling schemes with queries. Additional contributions are several extensions. In particular, we show that it is easy to extend our schemes for tree to work also in the dynamic scenario. We also demonstrate that the study of the queries model can help in designing a scheme for the traditional model too. Finally, we demonstrate extensions to the non-distributed environment. In particular, we show that one can preprocess a general weighted graph using almost linear space so that flow queries can be answered in almost constant time.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540729181
StatePublished - 2007
Externally publishedYes
Event14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 - Castiglioncello, Italy
Duration: 5 Jun 20078 Jun 2007

Publication series

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


Conference14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007


  • Distance queries
  • Labeling schemes
  • Routing schemes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Cite this