Distance labeling in graphs

Journal of Algorithms

Volumn 53, Issue 1, 2004, Pages 85-112

  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 CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; FUNCTIONS; LABELING; MATHEMATICAL MODELS;

BOUNDED DEGREE GRAPHS; DISTANCE LABELING; PLANAR GRAPHS;

GRAPH THEORY;

EID: 3943059465     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.05.002     Document Type: Article

References (15)

1. Alon N., Seymour P.D., Thomas R. A separator theorem for graphs with an excluded minor and its applications. 22nd Annual ACM Symposium on Theory of Computing (STOC). 1990;293-299.
2. Breuer M.A. Coding the vertexes of a graph. IEEE Trans. Inform. Theory. IT-12:1966;148-153.
3. Breuer M.A., Folkman J. An unexpected result on coding the vertices of a graph. J. Math. Anal. Appl. 20:1967;583-600.
4. Gavoille C., Paul C. Optimal distance labeling schemes for interval and circular-arc graphs. 11th Annual European Symposium on Algorithms (ESA). Lecture Notes in Comput. Sci. vol. 2832:2003;254-265 Springer.
5. Gilbert J.R., Hutchinson J.P., Tarjan R.E. A separation theorem for graphs of bounded genus. J. Algorithms. 5:1984;391-407.
6. Graham R.L., Pollak H.O. On embedding graphs in squashed cubes. Lecture Notes in Math. vol. 303:1972;99-110.
7. Kannan S., Naor M., Rudich S. Implicit representation of graphs. 20th Annual ACM Symposium on Theory of Computing (STOC), Chicago, IL. 1988;334-343.
8. Katz M., Katz N.A., Peleg D. Distance labeling schemes for well-separated graph classes. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Comput. Sci. vol. 1770:2000;516-528 Springer-Verlag.
9. Li M., Vitányi P.M.B. An Introduction to Kolmogorov Complexity and Its Applications. 1993;Springer-Verlag.
10. Peleg D. Informative labeling schemes for graphs. 25th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Comput. Sci. vol. 1893:2000;579-588 Springer.
11. Peleg D. Proximity-preserving labeling schemes. J. Graph Theory. 33:2000;167-176.
12. Peleg D., Upfal E. A trade-off between space and efficiency for routing tables. J. ACM. 36:1989;510-530.
13. Plotkin S.A., Rao S., Smith W.D. Shallow excluded minors and improved graph decomposition. 5th Symposium on Discrete Algorithms (SODA). 1994;462-470 ACM-SIAM.
14. Santoro N., Khatib R. Labelling and implicit routing in networks. The Computer Journal. 28:1985;5-8.
15. Winkler P. Proof of the squashed cube conjecture. Combinatorica. 3:1983;135-139.