Skip to main content
SpringerLink
Log in

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors

  • Conference paper
Algorithms - ESA 2008 (ESA 2008)

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

Included in the following conference series:

Abstract

We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log2 n)-bit labels has been previously presented by Peleg. By engineering this scheme, we obtain a variety of data structures with the same asymptotic performances. We conduct a thorough experimental evaluation of all these data structures. Our results clearly show which variants achieve the best performances in terms of space usage, construction time, and query time.

Work partially supported by MIUR, the Italian Ministry of Education, University and Research, under Project MainStream (“Algorithms for Massive Information Structures and Data Streams”).

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 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 189.00
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. Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling schemes for ancestor queries. SIAM J. on Computing 35(6), 1295–1309 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: Proc. ACM SPAA 2002, pp. 258–264 (2002)

    Google Scholar 

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

  5. Breuer, M.A.: Coding the vertexes of a graph. IEEE Transactions on Information Theory IT-12, 148–153 (1966)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Caminiti, S., Finocchi, I., Petreschi, R.: Concurrent data structures for lowest common ancestors (manuscript, 2008)

    Google Scholar 

  8. Caminiti, S., Finocchi, I., Petreschi, R.: On coding labeled trees. Theoretical Computer Science 382(2), 97–108 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. In: Proc. ACM-SIAM SODA 2002, pp. 937–946 (2002)

    Google Scholar 

  10. Cole, R., Hariharan, R.: Dynamic LCA Queries on Trees. SIAM J. on Computing 34(4), 894–923 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gavoille, C., Peleg, D., Perennes, S., Raz, R.: Distance labeling in graphs. In: Proc. ACM-SIAM SODA 2001, pp. 210–219 (2001)

    Google Scholar 

  12. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: Proc. ACM STOC 1988, pp. 334–343 (1988)

    Google Scholar 

  13. Kaplan, H., Milo, T., Shabo, R.: A Comparison of Labeling Schemes for Ancestor Queries. In: Proc. ACM-SIAM SODA 2002, pp. 954–963 (2002)

    Google Scholar 

  14. Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. on Computing 34(1), 23–40 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kopelowitz, T., Lewenstein, M.: Dynamic weighted ancestors. In: Proc. ACM-SIAM SODA 2007, pp. 565–574 (2007)

    Google Scholar 

  16. Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30–41. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 579–588. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Sapienza University of Rome, Via Salaria, 113, 00198, Rome, Italy

    Saverio Caminiti, Irene Finocchi & Rossella Petreschi

Authors
  1. Saverio Caminiti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irene Finocchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rossella Petreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dan Halperin Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caminiti, S., Finocchi, I., Petreschi, R. (2008). Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87744-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87743-1

  • Online ISBN: 978-3-540-87744-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation