Labeling Schemes for Tree Representation

  • Reuven Cohen
  • Pierre Fraigniaud
  • David Ilcinkas
  • Amos Korman
  • David Peleg
Conference paper

DOI: 10.1007/11603771_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3741)
Cite this paper as:
Cohen R., Fraigniaud P., Ilcinkas D., Korman A., Peleg D. (2005) Labeling Schemes for Tree Representation. In: Pal A., Kshemkalyani A.D., Kumar R., Gupta A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg

Abstract

This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling \({\mathcal L}_{all}\) gives each node v of G a label containing the port numbers of all the tree edges incident to v. The upward tree labeling \({\mathcal L}_{up}\) labels each node v by the number of the port leading from v to its parent in the tree. Our measure of interest is the worst case and total length of the labels used by the scheme, denoted Mup(T) and Sup(T) for \({\mathcal L}_{up}\) and Mall(T) and Sall(T) for \({\mathcal L}_{all}\). The problem studied in this paper is the following: Given a graph G and a predefined port labeling for it, with the ports of each node v numbered by 0,...,deg(v) – 1, select a rooted spanning tree for G minimizing (one of) these measures. We show that the problem is polynomial for Mup(T), Sup(T) and Sall(T) but NP-hard for Mall(T) (even for 3-regular planar graphs). We show that for every graph G and port numbering there exists a spanning tree T for which Sup(T) = O(n log log n). We give a tight bound of O(n) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port assignments. We conclude by discussing some applications for our tree representation schemes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Reuven Cohen
    • 1
  • Pierre Fraigniaud
    • 2
  • David Ilcinkas
    • 2
  • Amos Korman
    • 1
  • David Peleg
    • 1
  1. 1.Dept. of Computer ScienceWeizmann InstituteIsrael
  2. 2.CNRS, LRIUniversité Paris-SudFrance

Personalised recommendations