632 search results - page 48 / 127 » On Routing in Circulant Graphs |
167
click to vote
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
139
click to vote
WEBI
2007
Springer
15 years 11 months ago
2007
Springer
The virtual world is comprised of data items related to each other in a variety of contexts. Often such relations can be represented as graphs that evolve over time. Examples incl...
139
click to vote
ICNP
2000
IEEE
15 years 10 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
134
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
157
click to vote
SIGCOMM
1992
ACM
15 years 9 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...