Skip to main content
SpringerLink
Log in

Distributed Relationship Schemes for Trees

  • Conference paper
Algorithms and Computation (ISAAC 2007)

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

Included in the following conference series:

Abstract

We consider a distributed representation scheme for trees, supporting some special relationships between nodes at small distance. For instance, we show that for a tree T and an integer k we can assign local information on nodes such that we can decide for any two nodes u and v if the distance between u and v is at most k and if so, compute it only using the local information assigned. For trees with n nodes, the local information assigned by our scheme are binary labels of logn + O(klog(klog(n/k))) bits, improving the results of Alstrup, Bille, and Rauhe (SODA ’03).

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

    MATH  MathSciNet  Google Scholar 

  2. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: 12th Symposium on Discrete Algorithms (SODA), pp. 547–556 (January 2001)

    Google Scholar 

  3. Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Talwar, K., Ramasubramanian, V.: Reconstructing approximate tree metrics. In: 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 43–52. ACM Press, New York (2007)

    Google Scholar 

  4. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: 14th Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 689–698 (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 53–62. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  7. Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1122–1131. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Chepoi, V.D., Dragan, F.F., Vaxes, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms 61(2), 60–88 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chung, F.R.K.: Universal graphs and induced-universal graphs. Journal of Graph Theory 14, 443–454 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dragan, F.F., Lomonosov, I.: On compact and efficient routing in certain graph classes. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 402–414. Springer, Heidelberg (2004)

    Google Scholar 

  11. Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Gavoille, C., Ly, O.: Distance labeling in hyperbolic graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1071–1079. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Gavoille, C., Paul, C.: Optimal distance labeling schemes for interval and circular-arc graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 254–265. Springer, Heidelberg (2003)

    Google Scholar 

  14. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distributed Computing 16, 111–120 (2003) PODC 20-Year Special Issue

    Article  Google Scholar 

  15. Gavoille, C., Peleg, D., Pérennès, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53, 85–112 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gilbert, J.R., Rose, D.J., Edenbrandt, A.: A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods 5, 306–313 (1984)

    MATH  MathSciNet  Google Scholar 

  17. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334–343. ACM Press, New York (1988)

    Google Scholar 

  18. Korman, A., Kutten, S., Peleg, D.: Proof labeling system. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 9–18. ACM Press, New York (2005)

    Google Scholar 

  19. Korman, A., Peleg, D.: Compact separator decompositions in dynamic trees and applications to labeling schemes. In: 21st International Symposium on Distributed Computing (DISC). LNCS, vol. 4731, Springer, Heidelberg (2007)

    Google Scholar 

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

  21. Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10. ACM Press, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université de Bordeaux, France

    Cyril Gavoille & Arnaud Labourel

Authors
  1. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnaud Labourel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gavoille, C., Labourel, A. (2007). Distributed Relationship Schemes for Trees. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77120-3_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77118-0

  • Online ISBN: 978-3-540-77120-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation