Sciweavers

632 search results - page 31 / 127
» On Routing in Circulant Graphs
Sort
View
PODC
2006
ACM
14 years 3 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
13 years 9 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
GLOBECOM
2008
IEEE
14 years 4 months ago
Longest Edge Routing on the Spatial Aloha Graph
— The multihop spatial reuse Aloha (MSR-Aloha) protocol was recently introduced by Baccelli et al., where each transmitter selects the receiver among its feasible next hops that ...
Steven Weber, Nihar Jindal, Radha Krishna Ganti, M...
CCCG
2006
13 years 11 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
WDAG
2005
Springer
98views Algorithms» more  WDAG 2005»
14 years 3 months ago
Compact Routing for Graphs Excluding a Fixed Minor
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi