Sciweavers

70 search results - page 1 / 14
» Distance Labeling in Hyperbolic Graphs
Sort
View
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly
TON
2008
126views more  TON 2008»
13 years 4 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
JAL
2006
100views more  JAL 2006»
13 years 4 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
SIAMDM
2008
140views more  SIAMDM 2008»
13 years 4 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
ENDM
2007
100views more  ENDM 2007»
13 years 4 months ago
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
Sanming Zhou