Article

Approximate Distance Labeling Schemes

Authors:

Cyril Gavoille,

Christophe Paul,

David PelegAuthors Info & Claims

ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms

Pages 476 - 487

Published: 28 August 2001 Publication History

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.

References

[1]

M. A. Breuer and J. Folkman. An unexpected result on coding the vertices of a graph. J. of Mathematical Analysis and Applications, 20:583-600, 1967.

[2]

M. A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory, IT-12:148-153, 1966.

[3]

D. G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics, 10(3):399-430, Aug. 1997.

[4]

P. Erdös, A. RÉnyi, and V. T. S_os. On a problem of graph theory. In Studia Sci. Math. Hungar., vol. 1, pp. 215-235, 1966.

[5]

G. N. Frederickson and R. Janardan. E_cient message routing in planar networks. SIAM Journal on Computing, 18(4):843-857, Aug. 1989.

[6]

M. L. Fredman and D. E. Willard. Surpassing the information theoric bound with fusion trees. J. of Computer and System Sciences, 47:424-436, 1993.

[7]

M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, Harcourt Brace Jovanovich, Academic Press edition, 1980.

[8]

R. L. Graham and H. O. Pollak. On embedding graphs in squashed cubes. Lecture Notes in Mathematics, 303:99-110, 1972.

[9]

C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. TR RR-1250-00, LaBRI, University of Bordeaux, 351, cours de la LibÉration, 33405 Talence Cedex, France, Dec. 2000.

[10]

C. Gavoille, D. Peleg, S. PÉrennes, and R. Raz. Distance labeling in graphs. In 12th Symposium on Discrete Algorithms (SODA), pp. 210-219. ACM-SIAM, Jan. 2001.

[11]

M. Katz, N. A. Katz, and D. Peleg. Distance labeling schemes for well-separated graph classes. In 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 1770 of LNCS, pp. 516-528. Springer, Feb. 2000.

[12]

S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334-343, Chicago, IL, May 1988.

[13]

C. G. Lekkerkerker and J. Ch. Boland. Representation of a finite graph by a set of intervals on the real line. Fund. Math., 51:45-64, 1962.

[14]

F. Lazebnik, V. A. Ustimenko, and A. J. Woldar. A new series of dense graphs of high girth. Bulletin of American Mathematical Society (New Series), 32(1):73-79, 1995.

[15]

J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Symposium on Foundations of Computer Science (FOCS), pp. 118-126. IEEE Comp. Society Press, 1997.

[16]

J. I. Munro. Tables. In 16th FST&TCS, vol. 1180 of LNCS, pp. 37-42. Springer-Verlag, 1996.

[17]

D. Peleg. Proximity-preserving labeling schemes and their applications. In 25th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), vol. 1665 of LNCS, pp. 30-41. Springer, June 1999.

[18]

N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.

[19]

P. Winkler. Proof of the squashed cube conjecture. Combinatorica, 3(1):135-139, 1983.

Cited By

Gawrychowski PJanczewski WŁopuszański JMarx D(2021)Shorter labels for routing in treesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458194(2174-2193)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458194
Fraigniaud PPatt-Shamir BPerry M(2019)Randomized proof-labeling schemesDistributed Computing10.1007/s00446-018-0340-832:3(217-234)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s00446-018-0340-8
Alstrup SGavoille CHalvorsen EPetersen H(2016)Simpler, faster and shorter labels for distances in graphsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884460(338-350)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884460
Show More Cited By

Approximate Distance Labeling Schemes
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation

Recommendations

Dynamic adjacency labelling schemes
Labelling of some planar graphs with a condition at distance two

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer p ≥ q, the λ_p,q-number of graph G, denoted λ(G;p, q), is ...
Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)-f(v)|>=d if uv@?E(G), and |f(u)-f(v)|>=1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms

August 2001

536 pages

ISBN:3540424938

Editor:
Friedhelm Meyer auf der Heide

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 August 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gawrychowski PJanczewski WŁopuszański JMarx D(2021)Shorter labels for routing in treesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458194(2174-2193)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458194
Fraigniaud PPatt-Shamir BPerry M(2019)Randomized proof-labeling schemesDistributed Computing10.1007/s00446-018-0340-832:3(217-234)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s00446-018-0340-8
Alstrup SGavoille CHalvorsen EPetersen H(2016)Simpler, faster and shorter labels for distances in graphsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884460(338-350)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884460
Baruch MFraigniaud PPatt-Shamir BGeorgiou CSpirakis P(2015)Randomized Proof-Labeling SchemesProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767421(315-324)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767421
Kawarabayashi KSommer CThorup MKhanna S(2013)More compact oracles for approximate distances in undirected planar graphsProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627857(550-563)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627857
Lindblad JSladoje N(2012)Coverage segmentation based on linear unmixing and minimization of perimeter and boundary thicknessPattern Recognition Letters10.1016/j.patrec.2011.12.01433:6(728-738)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1016/j.patrec.2011.12.014
Dragan FKöhler E(2011)An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphsProceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques10.5555/2033252.2033268(171-183)Online publication date: 17-Aug-2011
https://dl.acm.org/doi/10.5555/2033252.2033268
Gavoille CSommer CMeyer auf der Heide FRajaraman R(2011)Sparse spanners vs. compact routingProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989526(225-234)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989526
Weimann OPeleg D(2011)A note on exact distance labelingInformation Processing Letters10.1016/j.ipl.2011.04.006111:14(671-673)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.ipl.2011.04.006
Korman APeleg DRodeh Y(2010)Constructing Labeling Schemes through Universal MatricesAlgorithmica10.5555/3118226.311847457:4(641-652)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.5555/3118226.3118474
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents