Distance labeling schemes for well-separated graph classes

Michal Katz, Nir A. Katz, David Peleg

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

31 Scopus citations

Abstract

Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown in this paper that the classes of interval graphs and permutation graphs enjoy such a distance labeling scheme using O(log2 n) bit labels on n- vertex graphs. Towards establishing these results, we present a general property for graphs, called well-(α; g)-separation, and show that graph classes satisfying this property have O(g(n) α log n) bit labeling schemes. In particular, interval graphs are well-(2; log n)-separated and permuta- tion graphs are well-(6; log n)-separated.

Original languageEnglish
Title of host publicationSTACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings
EditorsHorst Reichel, Sophie Tison
PublisherSpringer Verlag
Pages516-528
Number of pages13
ISBN (Print)9783540671411
DOIs
StatePublished - 2000
Event17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 - Lille, France
Duration: 17 Feb 200019 Feb 2000

Publication series

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

Conference

Conference17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000
Country/TerritoryFrance
CityLille
Period17/02/0019/02/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Fingerprint

Dive into the research topics of 'Distance labeling schemes for well-separated graph classes'. Together they form a unique fingerprint.

Cite this