Informative labeling schemes for graphs

Theoretical Computer Science

Volumn 340, Issue 3, 2005, Pages 577-593

  Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

INFORMATIVE LABELING SCHEMES; SPANNING TREE; STEINER TREE SPANNING; WEIGHTED GRAPH;

COMPUTER SCIENCE;

EID: 23844459328     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.015     Document Type: Conference Paper

References (10)

1. M.A. Breuer Coding the vertexes of a graph IEEE Trans. Inform. Theory IT-12 1966 148 153
2. M.A. Breuer, and J. Folkman An unexpected result on coding the vertices of a graph J. Math. Anal. Appl. 20 1967 583 600
3. C. Gavoille, D. Peleg, S. Pérennes, R. Raz, Distance labeling in graphs, in: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, January 2001, pp. 210-219.
4. S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, in: Proc. 20th ACM Symp. on Theory of Computing, May 1988, pp. 334-343.
5. M. Katz, N.A. Katz, A. Korman, D. Peleg, Labeling schemes for flow and connectivity, in: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, January 2002, pp. 927-936.
6. M. Katz, N.A. Katz, D. Peleg, Distance labeling schemes for well-separated graph classes, in: Proc. 17th Symp. on Theoretical Aspects of Computer Science, February 2000, pp. 516-528.
7. A. Korman, D. Peleg, Y. Rodeh, Labeling schemes for dynamic tree networks, in: Proc. 19th Symp. on Theoretical Aspects of Computer Science, March 2002, pp. 76-87.
8. L. Kou, G. Markowsky, and L. Berman A fast algorithm for Steiner trees Acta Inform. 15 1984 141 145
9. D. Peleg, Proximity-preserving labeling schemes and their applications, in: Proc. 25th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, June 1999, pp. 30-41.
10. N. Santoro, and R. Khatib Labelling and implicit routing in networks Comput. J. 28 1985 5 8