Sciweavers

70 search results - page 2 / 14
» Distance Labeling in Hyperbolic Graphs
Sort
View
INFOCOM
2009
IEEE
13 years 12 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
JCO
2007
113views more  JCO 2007»
13 years 5 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
SODA
2001
ACM
77views Algorithms» more  SODA 2001»
13 years 6 months ago
Distance labeling in graphs
Cyril Gavoille, David Peleg, Stephane Perennes, Ra...
EJC
2007
13 years 5 months ago
Labeling planar graphs with a condition at distance two
Peter Bella, Daniel Král, Bojan Mohar, Kata...
STACS
2007
Springer
13 years 11 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg