Labeling Schemes for Dynamic Tree Networks

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.