Labeling schemes for weighted dynamic trees

Amos Korman, David Peleg

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


A Distance labeling scheme is a type of localized network representation in which short labels are assigned to the vertices, allowing one to infer the distance between any two vertices directly from their labels, without using any additional information sources. As most applications for network representations in general, and distance labeling schemes in particular, concern large and dynamically changing networks, it is of interest to focus on distributed dynamic labeling schemes. The paper considers dynamic weighted trees where the vertices of the trees are fixed but the (positive integral) weights of the edges may change. The two models considered are the edge-dynamic model, where from time to time some edge changes its weight by a fixed quanta, and the increasing-dynamic model in which edge weights can only grow. The paper presents distributed approximate distance labeling schemes for the two dynamic models, which are efficient in terms of the required label size and communication complexity involved in updating the labels following the weight changes.

Original languageEnglish
Pages (from-to)1721-1740
Number of pages20
JournalInformation and Computation
Issue number12
StatePublished - Dec 2007
Externally publishedYes

Bibliographical note

Funding Information:
A preliminary version of this paper appeared in Proc. 30th Int. Colloq. on Automata, Languages & Prog., SV-LNCS 2719, 2003, pp. 369–383. ∗ Corresponding author. Fax: +972 8934 4122. E-mail addresses: (A. Korman), (D. Peleg). 1 Supported in part at the Technion by an Aly Kaufman fellowship. 2 Supported in part by a grant from the Israel Science Foundation.


  • Approximate distances
  • Distance labeling schemes
  • Distributed computing
  • Dynamic graphs


Dive into the research topics of 'Labeling schemes for weighted dynamic trees'. Together they form a unique fingerprint.

Cite this