Sciweavers

100 search results - page 4 / 20
» A distance-labelling problem for hypercubes
Sort
View
142
Voted
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 10 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
113
Voted
IPPS
1997
IEEE
15 years 7 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
114
Voted
ICPP
1993
IEEE
15 years 7 months ago
Fault Tolerant Subcube Allocation in Hypercubes
- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subc...
Yeimkuan Chang, Laxmi N. Bhuyan