Pierre Fraigniaud
ABSTRACT
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 introduced 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 2log 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 label size log n+O(√log n) by Abiteboul et al., [SICOMP 2006].
This paper aims at investigating the above notions from a probabilistic point of view. Informally, the goal is to investigate whether the label sizes can be improved if one allows for some probability of mistake when answering a query, and, if so, by how much. For that, we first present a model for probabilistic labeling schemes, and then construct various probabilistic one-sided error schemes for the adjacency and ancestry problems on trees. Some of our schemes significantly improve the bound on the label size of the corresponding deterministic schemes, while the others are matched with appropriate lower bounds showing that, for the resulting guarantees of success, one cannot expect to do much better in term of label size.
- S. Abiteboul, S. Alstrup, H. Kaplan, T. Milo and T. Rauhe. Compact labeling schemes for ancestor queries. SIAM Journal on Computing 35:1295--1309, 2006. Google Scholar
Digital Library
- S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 547--556, 2001. Google ScholarDigital Library
- S. Alstrup, P. Bille and T. Rauhe. Labeling Schemes for Small Distances in Trees. SIAM J. Discrete Math 19(2):448--462, 2005. Google ScholarDigital Library
- S. Alstrup and T. Rauhe. Small induced-universal graphs and compact implicit graph representations. In 43rd IEEE Symp. on Foundations of Computer Science (FOCS), pages 53--62, 2002. Google ScholarDigital Library
- M. Capalbo. A small universal graph for bounded-degree planar graphs. In 10th ACM-SIAM symposium on Discrete algorithms (SODA), pages 156--160, 1999. Google ScholarDigital Library
- T.-H. Chan, M. Dinitz, and A. Gupta. Spanners with Slack. In 14th European Symposium on Algorithms (ESA), LNCS 4168, pp. 196--207, 2006. Google ScholarDigital Library
- E. Cohen, H. Kaplan, and T. Milo. Labeling dynamic XML trees. In 21st ACM Symp. on Principles of Database Systems (PODS), pages 271--281, 2002. Google ScholarDigital Library
- P. Fraigniaud and A. Korman. Compact Ancestry Labeling Schemes for Trees of Small Depth. Submitted, 2009. (see http://arxiv.org/pdf/0902.3081).Google Scholar
- S. Kannan, M. Naor, and S. Rudich. Implicit Representation of Graphs. SIAM J. on Discrete Math 5: 596--603, 1992. Google ScholarDigital Library
- H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In Workshop on Algorithms and Data Structures (WADS), pages 246--257, 2001. Google ScholarDigital Library
- H. Kaplan, T. Milo and R. Shabo. A Comparison of Labeling Schemes for Ancestor Queries. In 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 954--963, 2002. Google ScholarDigital Library
- A. Korman, D. Peleg, and Y. Rodeh. Constructing Labeling Schemes Through Universal Matrices. Algorithmica, to appear.Google Scholar
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- D. Peleg. Informative labeling schemes for graphs. Theoretical Computer Science 340(3):577--593, 2005. Google ScholarDigital Library
- R. Rado. Universal graphs and universal functions. Acta Arithmetica 9:331--340, 1964.Google ScholarCross Ref
- M. Thorup and U. Zwick. Compact routing schemes. In 13th ACM Symp. on Parallel Algorithms and Architecture (SPAA), pages 1--10, 2001. Google ScholarDigital Library
Index Terms
- On randomized representations of graphs using short labels
Recommendations
Shorter Labeling Schemes for Planar Graphs
An adjacency labeling scheme for a given class of graphs is an algorithm that, for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent can be determined by a ...
Adjacency Labeling Schemes and Induced-Universal Graphs
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingWe describe a way of assigning labels to the vertices of any undirected graph on up to n vertices, each composed of n/2+O(1) bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible to decide whether ...
Randomized function evaluation on a ring
LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has ...
Comments