Approximate distance labeling schemes (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 476-487

  Gavoille, Cyril ^a   Katz, Michal ^b   Katz, Nir A ^b   Paul, Christophe ^a   Peleg, David ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b BAR ILAN UNIVERSITY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximate distance; Distributed data structures; Labeling schemes; Local representations

Indexed keywords

GRAPHIC METHODS;

APPROXIMATE DISTANCE; BOUNDED-TREEWIDTH GRAPHS; CHORDAL GRAPHS; DISTANCE LABELING SCHEMES; DISTRIBUTED DATA STRUCTURES; EXTENDED ABSTRACTS; LABELING SCHEME; LOCAL REPRESENTATIONS;

TREES (MATHEMATICS);

EID: 84943251173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_40     Document Type: Conference Paper

References (19)

1. M. A. Breuer and J. Folkman. An unexpected result on coding the vertices of a graph. J. of Mathematical Analysis and Applications, 20:583-600, 1967.
2. M. A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory, IT-12:148-153, 1966.
3. D. G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics, 10(3):399-430, Aug. 1997.
4. P. Erdös, A. Rényi, and V. T. Sás. On a problem of graph theory. In Studia Sci. Math. Hungar., vol. 1, pp. 215-235, 1966.
5. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843-857, Aug. 1989.
6. M. L. Fredman and D. E. Willard. Surpassing the information theoric bound with fusion trees. J. of Computer and System Sciences, 47:424-436, 1993.
7. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, Harcourt Brace Jovanovich, Academic Press edition, 1980.
8. R. L. Graham and H. O. Pollak. On embedding graphs in squashed cubes. Lecture Notes in Mathematics, 303:99-110, 1972.
9. C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. TR RR-1250-00, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, Dec. 2000.
10. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. In 12th Symposium on Discrete Algorithms (SODA), pp. 210-219. ACM-SIAM, Jan. 2001.
11. M. Katz, N. A. Katz, and D. Peleg. Distance labeling schemes for well-separated graph classes. In 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 1770 of LNCS, pp. 516-528. Springer, Feb. 2000.
12. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334-343, Chicago, IL, May 1988.
13. C. G. Lekkerkerker and J. Ch. Boland. Representation of a finite graph by a set of intervals on the real line. Fund. Math., 51:45-64, 1962.
14. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar. A new series of dense graphs of high girth. Bulletin of American Mathematical Society (New Series), 32(1):73-79, 1995.
15. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Symposium on Foundations of Computer Science (FOCS), pp. 118-126. IEEE Comp. Society Press, 1997.
16. J. I. Munro. Tables. In 16th FST&TCS, vol. 1180 of LNCS, pp. 37-42. Springer-Verlag, 1996.
17. D. Peleg. Proximity-preserving labeling schemes and their applications. In 25th International Workshop, Graph-Theoretic Concepts in Computer Science (WG), vol. 1665 of LNCS, pp. 30-41. Springer, June 1999.
18. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. Journal of Algorithms, 7:309-322, 1986.
19. P. Winkler. Proof of the squashed cube conjecture. Combinatorica, 3(1):135-139, 1983.