112 search results - page 10 / 23 » A Ramsey-type result for the hypercube |
IPL
2008
13 years 7 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
JCT
1998
13 years 7 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
ICPADS
2000
IEEE
13 years 11 months ago
2000
IEEE
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...
JPDC
2006
13 years 7 months ago
2006
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
TCS
2002
13 years 7 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...