Skip to main content
SpringerLink
Log in

Labeling Schemes for Bounded Degree Graphs

  • Conference paper
Book cover Automata, Languages, and Programming (ICALP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8573))

Included in the following conference series:

Abstract

We investigate adjacency labeling schemes for graphs of bounded degree Δ = O(1). In particular, we present an optimal (up to an additive constant) logn + O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud and Korman, SODA 2010], and may provide new insights for closing the long standing gap for adjacency in trees [Alstrup and Rauhe, FOCS 2002]. We also provide improved labeling schemes for bounded degree planar graphs. Finally, we use combinatorial number systems and present an improved adjacency labeling schemes for graphs of bounded degree Δ with \((e+1)\sqrt{n} < \Delta \leq n/5\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Disc. Math. 19(2), 448–462 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, pp. 258–264 (2002)

    Google Scholar 

  3. Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62. IEEE (2002)

    Google Scholar 

  4. Bhatt, S., Chung, F.R.K., Leighton, T., Rosenberg, A.: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Disc. Math. 2(2), 145–155 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bonichon, N., Gavoille, C., Labourel, A.: Short labels by traversal and jumping. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 143–156. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Bonichon, N., Gavoille, C., Labourel, A.: Short labels by traversal and jumping. Electr. Notes in Discrete Math. 28, 153–160 (2007)

    Article  MathSciNet  Google Scholar 

  7. Butler, S.: Induced-universal graphs for graphs with bounded maximum degree. Graphs Combinator. 25(4), 461–468 (2009)

    Article  MATH  Google Scholar 

  8. Chung, F.R.K.: Separator theorems and their applications. Forschungsinst. Für Diskrete Mathematik (1989)

    Google Scholar 

  9. Chung, F.R.K.: Universal graphs and induced-universal graphs. J. Graph Theor. 14(4), 443–454 (1990)

    MATH  Google Scholar 

  10. Esperet, L., Labourel, A., Ochem, P.: On induced-universal graphs for the class of bounded-degree graphs. Inform. Process. Lett. 108(5), 255–260 (2008)

    Article  MathSciNet  Google Scholar 

  11. Fraigniaud, P., Korman, A.: Compact ancestry labeling schemes for xml trees. In: Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 458–466 (2010)

    Google Scholar 

  12. Fraigniaud, P., Korman, A.: Compact ancestry labeling schemes for xml trees. In: Proc. 21st ACM-SIAM Symp. on Discrete Algorithms, SODA 2010 (2010)

    Google Scholar 

  13. Gavoille, C., Labourel, A.: Shorter implicit representation for planar graphs and bounded treewidth graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 582–593. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Math. 273, 115–130 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: Proc. of the 20th ACM Symposium on Theory of Computing, STOC 1988, pp. 334–343 (1988)

    Google Scholar 

  16. Knuth, D.: Combinatorial algorithms. The Art of Computer Programming, vol. 4a (2011)

    Google Scholar 

  17. Korman, A., Peleg, D., Rodeh, Y.: Constructing labeling schemes through universal matrices. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 409–418. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Laoutaris, N., Rajaraman, R., Sundaram, R., Teng, S.H.: A bounded-degree network formation game. arXiv preprint cs/0701071 (2007)

    Google Scholar 

  19. Moon, J.W.: On minimal n-universal graphs. In: Proc. of the Glasgow Math. Assoc. vol. 7, pp. 32–33 (1965)

    Google Scholar 

  20. Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 1(1), 445–450 (1961)

    Article  MathSciNet  Google Scholar 

  21. Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, New York, pp. 1–10 (2001)

    Google Scholar 

  22. Wang, Y., Li, X.Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Networks and Applications 11(2), 161–175 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Operations Research, ETH, Rämistrasse 101, 8092, Zürich, Switzerland

    David Adjiashvili

  2. Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark

    Noy Rotbart

Authors
  1. David Adjiashvili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Noy Rotbart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, 85748, München, Germany

    Javier Esparza

  2. LIAFA, Université Paris Diderot-Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Thore Husfeldt

  4. Department Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK,

    Elias Koutsoupias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adjiashvili, D., Rotbart, N. (2014). Labeling Schemes for Bounded Degree Graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43951-7_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43950-0

  • Online ISBN: 978-3-662-43951-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation