263 search results - page 5 / 53 » Path partitions of hypercubes |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
IPL
2010
13 years 5 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
JCIT
2008
13 years 7 months ago
2008
This paper proposes a packet partition scheduling mechanism for bandwidth aggregation over end-to-end multi-path through multiple network interfaces. The proposed mechanism effect...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...