Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz  Home/Search
Context Related
| deptinfo.labri.fr/~gavo...GPPR04.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: deptinfo.labri...oille_publis.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases. We obtain upper and lower bounds for several interesting families of graphs. In particular, our main results are the following. For general graphs, we show that the length needed is #(n). For trees, we show that the... (Update)
Similar documents based on text: More All
0.6: Distance Labeling in Graphs - Gavoille, Peleg, al. (2000) (Correct)
0.4: Distance Labeling in Graphs (Extended Abstract) - Gavoille, Peleg.. (Correct)
0.4: Distance and Routing Labeling Schemes for Non-positively Curved .. - Chepoi, al. (2004) (Correct)
BibTeX entry: (Update)
C. Gavoille, D. Peleg, S. Perennes, R. Raz, Distance labeling in graphs, Research Report RR-1239-00, 2000, LaBRI. http://citeseer.ist.psu.edu/gavoille00distance.html More
@inproceedings{ gavoille01distance,
author = "Cyril Gavoille and David Peleg and Stephane Perennes and Ran Raz",
title = "Distance labeling in graphs",
booktitle = "Symposium on Discrete Algorithms",
pages = "210-219",
year = "2001",
url = "citeseer.ist.psu.edu/gavoille00distance.html" }
Citations (may not include all citations):660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vitnyi - 1993
101 Labelling and implicit routing in networks (context) - Santoro, Khatib - 1985
66 A trade-off between space and efficiency for routing tables (context) - Peleg, Upfal - 1989
61 A separator theorem for graphs with an excluded minor and it.. (context) - Alon, Seymour et al. - 1990
26 Implicit representation of graphs - Kannan, Naor et al. - 1988
21 Informative labeling schemes for graphs (context) - Peleg - 2000
19 On embedding graphs in squashed cubes (context) - Graham, Pollak - 1972
17 Shallow excluded minors and improved graph decomposition - Plotkin, Rao et al. - 1994
16 Distance labeling schemes for well-separated graph classes (context) - Katz, Katz et al. - 2000
16 A separation theorem for graphs of bounded genus (context) - Gilbert, Hutchinson et al. - 1984
14 Proximity-preserving labeling schemes (context) - Peleg - 2000
12 Proof of the squashed cube conjecture (context) - Winkler - 1983
12 An unexpected result on coding the vertices of a graph (context) - Breuer, Folkman - 1967
9 Coding the vertexes of a graph (context) - Breuer - 1966
2 Optimal distance labeling schemes for interval and circular-.. (context) - Gavoille, Paul - 2003
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dept-info.labri.fr/~gavoille/gavoille_publis.fr.html): More
Planar Graphs, via Well-Orderly Maps and Trees - Bonichon, Gavoille, Hanusse.. (Correct)
Header-Size Lower Bounds for End-to-End Communication in.. - Fraigniaud, Gavoille (2004) (Correct)
Eclecticism Shrinks the World - Fraigniaud, Gavoille, Paul (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC