Abstract
This paper introduces and studies the notion of informative labeling schemes for arbitrary graphs. Let f(W) be a function on subsets of vertices W. An f labeling scheme labels the vertices of a weighted graph G in such a way that f(W) can be inferred efficiently for any vertex subset W of G by merely inspecting the labels of the vertices of W, without having to use any additional information sources.
The paper develops f labeling schemes for some functions f over the class of n-vertex trees, including SepLevel, the separation level of any two vertices in the tree, LCA, the least common ancestor of any two vertices, and Center, the center of any three given vertices in the tree. These schemes use O(log2 n)-bit labels, which is asymptotically optimal.
We then turn to weighted graphs and consider the function Steiner(W), denoting the weight of the Steiner tree spanning the vertices of W in the graph. For n-vertex weighted trees with M-bit edge weights, it is shown that there exists a Steiner labeling scheme using O((M+log n) log n) bit labels, which is asymptotically optimal. In the full paper it is shown that for the class of arbitrary n-vertex graphs with M-bit edge weights, there exists an approximate- Steiner labeling scheme, providing an estimate (up to a logarithmic factor) for Steiner(W) using O((M + logn) log2 n) bit labels.
Supported in part by a grant from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M.A. Breuer and J. Folkman. An unexpected result on coding the vertices of a graph. J. Mathemat. Analysis and Applic., 20:583–600, 1967.
M.A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory, IT-12:148–153, 1966.
C. Gavoille, D. Peleg, S. Pérennes and R. Raz. Distance labeling in graphs. Unpublished manuscript, September 1999.
M. Katz, N.A. Katz and D. Peleg. Distance labeling schemes for well-separated graph classes. In Proc. 17th STACS, pages 516–528, 2000.
L. Kou, G. Markowsky and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15:141–145, 1981.
S. Kannan, M. Naor and S. Rudich. Implicit representation of graphs. In Proc. 20th STOC, pages 334–343, May 1988.
D. Peleg. Proximity-preserving labeling schemes and their applications. In Proc. 25th WG, pages 30–41, June 1999.
D. Peleg. Informative labeling schemes for graphs. Technical Report MCS00-05, The Weizmann Institute of Science, 2000.
N. Santoro and R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28:5–8, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2000). Informative Labeling Schemes for Graphs. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_53
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive