Distance labeling in graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 210-219

  Gavoille, Cyril ^a   Peleg, David ^b   Pérennes, Stéphane ^c   Raz, Ran ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c INRIA   (France)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 57749210158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. N. Alon , P. Seymour , R. Thomas, A separator theorem for graphs with an excluded minor and its applications, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.293-299, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100254]
2. M. A. BREUER, Coding the vertexes of a graph, IEEE Trans. Inf. Theory, IT-12 (1966), pp. 148-153.
3. M. A. BREUER AND Z. FOLKMAN, An unexpected result on coding the vertices of a graph, J. of Mathematical Analysis and Applications, 20 (1967), pp. 583-600.
4. C. GAVOILLE, D. FELEG, S. PERENNES, AND R. RAZ, Distance labeling in graphs, Research Report RR-1182- 97, LaBRI, Univ. of Bordeaux, Talence, France, 1999.
5. John R. Gilbert , Joan P. Hutchinson , Robert Endre Tarjan, A separator theorem for graphs of bounded genus, Journal of Algorithms, v.5 n.3, p.391-407, Sept. 1984 [doi>10.1016/0196-6774(84)90019-1]
6. R. L. GRAHAM AND H. O. POLLAK, On embedding graphs in squashed cubes, Lecture Notes in Mathematics, 303 (1972), pp. 99-119.
7. Sampath Kannan , Moni Naor , Steven Rudich, Implicit representation of graphs, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.334-343, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62244]
8. Michal Katz , Nir A. Katz , David Peleg, Distance Labeling Schemes for Well-Separated Graph Classes, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, p.516-528, February 01, 2000
9. David Peleg, Proximity-Preserving Labeling Schemes and Their Applications, Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, p.30-41, June 17-19, 1999
10. David Peleg, Informative Labeling Schemes for Graphs, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, p.579-588, September 01, 2000
11. David Peleg , Eli Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM (JACM), v.36 n.3, p.510-530, July 1989 [doi>10.1145/65950.65953]
12. Serge Plotkin , Satish Rao , Warren D. Smith, Shallow excluded minors and improved graph decompositions, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.462-470, January 23-25, 1994, Arlington, Virginia, United States
13. N. SANTORO AND R. KHATIB, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5-8.
14. P. WINKLER, Proof of the squashed cube conjecture, Combinatorica, 3 (1983), pp. 135-139.