632 search results - page 13 / 127 » On Routing in Circulant Graphs |
CISS
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
WG
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
ISCI
2008
13 years 9 months ago
2008
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
MOBICOM
2006
ACM
14 years 3 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...