Labeling Schemes for Dynamic Tree Networks

Amos Korman; David Peleg; Yoav Rodeh

doi:10.1007/s00224-003-1106-6

Labeling Schemes for Dynamic Tree Networks

Amos Korman
, David Peleg
, Yoav Rodeh

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

40 Scopus citations

Abstract

The labeling schemes introduced for the dynamic tree models were studied. The studied distance labeling schemes were considered in the distributed dynamic environment. Distance labeling scheme, with amortized message complexity, was based on the extension of an existing static labeling scheme to the dynamic setting. The main resulting scheme for the dynamically growing trees, with no vertex deletions, was found to incur an overhead in both the label size and amortized message complexity.

Original language	English
Pages (from-to)	49-75
Number of pages	27
Journal	Theory of Computing Systems
Volume	37
Issue number	1
DOIs	https://doi.org/10.1007/s00224-003-1106-6
State	Published - Jan 2004
Externally published	Yes

Bibliographical note

Funding Information:
∗ David Peleg was supported in part by a grant from the Israel Science Foundation.

Funding

∗ David Peleg was supported in part by a grant from the Israel Science Foundation.

Funders
Israel Science Foundation

Access to Document

10.1007/s00224-003-1106-6

Cite this

@article{aff4afb620cc4fcea9f0fe46ddc0785f,

title = "Labeling Schemes for Dynamic Tree Networks",

abstract = "The labeling schemes introduced for the dynamic tree models were studied. The studied distance labeling schemes were considered in the distributed dynamic environment. Distance labeling scheme, with amortized message complexity, was based on the extension of an existing static labeling scheme to the dynamic setting. The main resulting scheme for the dynamically growing trees, with no vertex deletions, was found to incur an overhead in both the label size and amortized message complexity.",

author = "Amos Korman and David Peleg and Yoav Rodeh",

note = "Funding Information: ∗ David Peleg was supported in part by a grant from the Israel Science Foundation.",

year = "2004",

month = jan,

doi = "10.1007/s00224-003-1106-6",

language = "אנגלית",

volume = "37",

pages = "49--75",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Labeling Schemes for Dynamic Tree Networks

AU - Korman, Amos

AU - Peleg, David

AU - Rodeh, Yoav

N1 - Funding Information: ∗ David Peleg was supported in part by a grant from the Israel Science Foundation.

PY - 2004/1

Y1 - 2004/1

N2 - The labeling schemes introduced for the dynamic tree models were studied. The studied distance labeling schemes were considered in the distributed dynamic environment. Distance labeling scheme, with amortized message complexity, was based on the extension of an existing static labeling scheme to the dynamic setting. The main resulting scheme for the dynamically growing trees, with no vertex deletions, was found to incur an overhead in both the label size and amortized message complexity.

AB - The labeling schemes introduced for the dynamic tree models were studied. The studied distance labeling schemes were considered in the distributed dynamic environment. Distance labeling scheme, with amortized message complexity, was based on the extension of an existing static labeling scheme to the dynamic setting. The main resulting scheme for the dynamically growing trees, with no vertex deletions, was found to incur an overhead in both the label size and amortized message complexity.

UR - https://www.scopus.com/pages/publications/1342333624

U2 - 10.1007/s00224-003-1106-6

DO - 10.1007/s00224-003-1106-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:1342333624

SN - 1432-4350

VL - 37

SP - 49

EP - 75

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 1

ER -

Labeling Schemes for Dynamic Tree Networks

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this