Distance Labeling Schemes for Well-Separated Graph Classes
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown in this paper that the classes of interval graphs and permutation graphs enjoy such a distance labeling scheme using O(log2n) bit labels on n-vertex graphs. Towards establishing these results, we present a general property for graphs, called well-(α, g)-separation, and show that graph classes satisfying this property have O(g(n) · log n) bit labeling schemes. In particular, interval graphs are well-(2, log n)-separated and permutation graphs are well-(6; log n)-separated.
Unable to display preview. Download preview PDF.
- [GPPR99]C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. In preparation, 1999.Google Scholar
- [Gol80]M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.Google Scholar
- [KNR88]S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 334–343, May 1988.Google Scholar
- [KKP99]M. Katz, N. Katz and D. Peleg. Distance Labeling Schemes for Well-Separated Graph Classes. Technical Report MCS99-26, the Weizmann Institute of Science, 1999.Google Scholar
- [Pel99]D. Peleg. Proximity-preserving labeling schemes and their applications. In Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science, June 1999.Google Scholar