On randomized representations of graphs using short labels

Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting merely the labels of the corresponding nodes. Typically, the main goal of such schemes is to minimize the label size, that is, the maximum number of bits stored in a label. This concept was introduces by Kannan et al. [STOC'88] and was illustrated by giving very simple and elegant labeling schemes, for supporting adjacency and ancestry queries in n-node trees; both these schemes have label size 2 log n. Motivated by relations between such schemes and other important notions such as universal graphs, extensive research has been made by the community to further reduce the label sizes of such schemes as much as possible. The current state of the art adjacency labeling scheme for trees has label size log n + O(log n) by Alstrup and Rauhe [FOCS'02], and the best known ancestry scheme for (rooted) trees has l...

• Type: Conference
• Year: 2009
• Where: SPAA
• Authors: Pierre Fraigniaud, Amos Korman
• Keywords: Elegant Labeling Schemes, Label Size Log, Parallel Computing, Probabilistic Labeling Schemes, SPAA 2009