Sciweavers

ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
14 years 5 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