Approximate distance labeling schemes (Extended abstract)

Cyril Gavoille; Michal Katz; Nir A. Katz; Christophe Paul; David Peleg

doi:10.1007/3-540-44676-1_40

Approximate distance labeling schemes (Extended abstract)

Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg

Department of Mathematics

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

78 Scopus citations

Abstract

We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u; v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.

Original language	English
Title of host publication	Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
Editors	Friedhelm Meyer auf der Heide
Publisher	Springer Verlag
Pages	476-487
Number of pages	12
ISBN (Print)	9783540424932
DOIs	https://doi.org/10.1007/3-540-44676-1_40
State	Published - 2001
Event	9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark Duration: 28 Aug 2001 → 31 Aug 2001

Publication series

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

Conference

Conference	9th Annual European Symposium on Algorithms, ESA 2001
Country/Territory	Denmark
City	Arhus
Period	28/08/01 → 31/08/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Keywords

Approximate distance
Distributed data structures
Labeling schemes
Local representations

Access to Document

10.1007/3-540-44676-1_40

Cite this

Gavoille, C., Katz, M., Katz, N. A., Paul, C., & Peleg, D. (2001). Approximate distance labeling schemes (Extended abstract). In F. M. auf der Heide (Ed.), Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings (pp. 476-487). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_40

Gavoille, Cyril ; Katz, Michal ; Katz, Nir A. et al. / Approximate distance labeling schemes (Extended abstract). Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. editor / Friedhelm Meyer auf der Heide. Springer Verlag, 2001. pp. 476-487 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{00590698990a4ac2a7fd8a461edf6e60,

title = "Approximate distance labeling schemes (Extended abstract)",

abstract = "We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u; v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.",

keywords = "Approximate distance, Distributed data structures, Labeling schemes, Local representations",

author = "Cyril Gavoille and Michal Katz and Katz, {Nir A.} and Christophe Paul and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 9th Annual European Symposium on Algorithms, ESA 2001 ; Conference date: 28-08-2001 Through 31-08-2001",

year = "2001",

doi = "10.1007/3-540-44676-1_40",

language = "אנגלית",

isbn = "9783540424932",

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

publisher = "Springer Verlag",

pages = "476--487",

editor = "{auf der Heide}, {Friedhelm Meyer}",

booktitle = "Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings",

address = "גרמניה",

}

Gavoille, C, Katz, M, Katz, NA, Paul, C & Peleg, D 2001, Approximate distance labeling schemes (Extended abstract). in FM auf der Heide (ed.), Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2161, Springer Verlag, pp. 476-487, 9th Annual European Symposium on Algorithms, ESA 2001, Arhus, Denmark, 28/08/01. https://doi.org/10.1007/3-540-44676-1_40

Approximate distance labeling schemes (Extended abstract). / Gavoille, Cyril; Katz, Michal; Katz, Nir A. et al.
Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. ed. / Friedhelm Meyer auf der Heide. Springer Verlag, 2001. p. 476-487 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161).

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

TY - GEN

T1 - Approximate distance labeling schemes (Extended abstract)

AU - Gavoille, Cyril

AU - Katz, Michal

AU - Katz, Nir A.

AU - Paul, Christophe

AU - Peleg, David

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

PY - 2001

Y1 - 2001

N2 - We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u; v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.

AB - We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u; v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.

KW - Approximate distance

KW - Distributed data structures

KW - Labeling schemes

KW - Local representations

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

U2 - 10.1007/3-540-44676-1_40

DO - 10.1007/3-540-44676-1_40

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

AN - SCOPUS:84943251173

SN - 9783540424932

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

SP - 476

EP - 487

BT - Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings

A2 - auf der Heide, Friedhelm Meyer

PB - Springer Verlag

T2 - 9th Annual European Symposium on Algorithms, ESA 2001

Y2 - 28 August 2001 through 31 August 2001

ER -

Gavoille C, Katz M, Katz NA, Paul C, Peleg D. Approximate distance labeling schemes (Extended abstract). In auf der Heide FM, editor, Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. Springer Verlag. 2001. p. 476-487. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44676-1_40

Approximate distance labeling schemes (Extended abstract)

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this