General compact labeling schemes for dynamic trees

@article{Korman2005GeneralCL,
  title={General compact labeling schemes for dynamic trees},
  author={Amos Korman},
  journal={Distributed Computing},
  year={2005},
  volume={20},
  pages={179-193},
  url={https://api.semanticscholar.org/CorpusID:5636993}
}
This paper investigates labeling schemes for dynamic trees with asymptotically optimal label sizes and sublinear amortized message complexity for the ancestry relation, the id-based and label-based nearest common ancestor relation and the routing function.
[PDF] Semantic Reader
30 Citations
Background Citations
16
Methods Citations
6

30 Citations

Compact separator decompositions in dynamic trees and applications to labeling schemes

It is shown how to use the dynamic separator decomposition scheme to construct dynamic labeling schemes supporting the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance labeling schemes.

Constructing Labeling Schemes through Universal Matrices

It is illustrated that the notion of universal matrices can be used to efficiently construct f-labeling schemes, and it is shown that the family of n-node graphs which are unions of disjoint circles enjoys an adjacency labeling scheme of size log n+O(1).

Labeling Schemes with Queries

This paper shows that one can preprocess a general weighted graph using almost linear space so that flow queries can be answered in almost constant time and extensions to the non-distributed environment are demonstrated.

An Evaluation of Dynamic Labeling Schemes for Tree Networks

An implementation and evaluation based on simulation of dynamic labeling schemes for tree networks suggest that the current practice of counting total messages passed in the whole network is insufficient to properly characterize performance of these distributed algorithms.

Improved compact routing schemes for dynamic trees

Two compact routing schemes for dynamic trees that incur extremely low message complexity and can support more types of topology changes than previous schemes are presented.

A note on models for graph representations

A note on labeling schemes for graph connectivity

Near Optimal Adjacency Labeling Schemes for Power-Law Graphs

An adjacency labeling scheme labels the n nodes of a graph with bit strings in a way that allows, given the labels of two nodes, to determine adjacency based only on those bit strings. Though many…

Compact ancestry labeling schemes for XML trees

Motivated by the fact that typical XML trees have extremely small depth, this paper parameterizes the quality measure of an ancestry scheme not only by the number of nodes in the given tree but also by its depth.

Compact Ancestry Labeling Schemes for Trees of Small Depth

An ancestry labeling scheme of size $\log n+2\log d +O(1)$, for the family of trees with at most $n$ nodes and depth at most d, and proves a result that may be of independent interest concerning the existence of a linear {\em universal graph} for thefamily of forests with trees of bounded depth.

53 References

Labeling Schemes for Dynamic Tree Networks

The problem on dynamic trees is considered, efficient distributed schemes for it are proposed, and a more general labeling scheme is introduced for the dynamic tree model, based on extending an existing static tree labeling scheme to the dynamic setting.

Labeling schemes for weighted dynamic trees

Informative labeling schemes for graphs

Proximity-Preserving Labeling Schemes and Their Applications

It is shown that for the class of n-vertex weighted trees with M-bit edge weights, there exists such a proximity-preserving labeling scheme using O(M log n + log2n) bit labels, and proposed a labeling scheme that can provide approximate estimates to the distance.

Compact labeling schemes for ancestor queries

This paper proposes a labeling scheme with maximum label size close to 3/2 log n, which is close to the lower bound of log n that follows from the fact that different vertices must have different labels.

A data structure for dynamic trees

An O(mn log n)-time algorithm is obtained to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse graphs.

Improved labeling scheme for ancestor queries

A labeling scheme for rooted trees that supports ancestor queries and assigns to each node a label which is a binary string, among other things motivated in connection with efficient representation of information for XML-based search engines for the internet.

Approximate Distance Labeling Schemes

This work develops constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs).

Distance labeling schemes for well-separated graph classes

Distance labeling in graphs

...