Distance labeling schemes for well-separated graph classes

Michal Katz; Nir A. Katz; David Peleg

doi:10.1007/3-540-46541-3_43

Distance labeling schemes for well-separated graph classes

Michal Katz, Nir A. Katz, David Peleg

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 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(log² 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 language	English
Title of host publication	STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings
Editors	Horst Reichel, Sophie Tison
Publisher	Springer Verlag
Pages	516-528
Number of pages	13
ISBN (Print)	9783540671411
DOIs	https://doi.org/10.1007/3-540-46541-3_43
State	Published - 2000
Event	17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 - Lille, France Duration: 17 Feb 2000 → 19 Feb 2000

Publication series

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

Conference

Conference	17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000
Country/Territory	France
City	Lille
Period	17/02/00 → 19/02/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/3-540-46541-3_43

Cite this

Katz, M., Katz, N. A., & Peleg, D. (2000). Distance labeling schemes for well-separated graph classes. In H. Reichel, & S. Tison (Eds.), STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings (pp. 516-528). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1770). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_43

Katz, Michal ; Katz, Nir A. ; Peleg, David. / Distance labeling schemes for well-separated graph classes. STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. editor / Horst Reichel ; Sophie Tison. Springer Verlag, 2000. pp. 516-528 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1e0d891f1cb5465a8c096c6ba68d5bde,

title = "Distance labeling schemes for well-separated graph classes",

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

author = "Michal Katz and Katz, {Nir A.} and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 ; Conference date: 17-02-2000 Through 19-02-2000",

year = "2000",

doi = "10.1007/3-540-46541-3_43",

language = "אנגלית",

isbn = "9783540671411",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "516--528",

editor = "Horst Reichel and Sophie Tison",

booktitle = "STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings",

address = "גרמניה",

}

Katz, M, Katz, NA & Peleg, D 2000, Distance labeling schemes for well-separated graph classes. in H Reichel & S Tison (eds), STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1770, Springer Verlag, pp. 516-528, 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Lille, France, 17/02/00. https://doi.org/10.1007/3-540-46541-3_43

Distance labeling schemes for well-separated graph classes. / Katz, Michal; Katz, Nir A.; Peleg, David.
STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. ed. / Horst Reichel; Sophie Tison. Springer Verlag, 2000. p. 516-528 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1770).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distance labeling schemes for well-separated graph classes

AU - Katz, Michal

AU - Katz, Nir A.

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

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

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

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

U2 - 10.1007/3-540-46541-3_43

DO - 10.1007/3-540-46541-3_43

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84944036235

SN - 9783540671411

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

SP - 516

EP - 528

BT - STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings

A2 - Reichel, Horst

A2 - Tison, Sophie

PB - Springer Verlag

T2 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000

Y2 - 17 February 2000 through 19 February 2000

ER -

Katz M, Katz NA, Peleg D. Distance labeling schemes for well-separated graph classes. In Reichel H, Tison S, editors, STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Springer Verlag. 2000. p. 516-528. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46541-3_43

Distance labeling schemes for well-separated graph classes

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this