A distance d on a nite set V is hypercube embeddable if it can be isometrically embedded into the hypercube f0; 1g m for some m 1, i.e., if the elements i 2 V can be labeled by sets A i in such a way that d(i; j) = jA i 4A j j for all i; j 2 V. Testing whether a distance d is hypercube embeddable is an NP-complete problem, even if d is assumed to take its values in f2; 3; 4; 6g ((Chv80]). On th...

The Mortonor z-curve is one example for a space filling curve: Given a level of refinement L ∈ N0, it maps the interval [0, 2)∩Z one-to-one to a set of d-dimensional cubes of edge length 2−L that form a subdivision of the unit cube. Similar curves have been proposed for triangular and tetrahedral unit domains. In contrast to the Hilbert curve that is continuous, the Morton-type curves produce j...

In this paper, we present a new algorithm to solve the integral knapsack problem on the hypercube. The main idea is to use the fact that the precedence graph of the dynamic programming function of the knapsack problem is an irregular mesh. We propose a scheduling algorithm for irregular meshes on the hypercube. The efficiency of the algorithm is independent on the number of processors. We also ...

Bidirectional associative memories (BAMs) are being used extensively for solving a variety of problems related to pattern recognition. The simulation of BAMs comprising of large number of neurons involves intensive computation and communication. In this paper we discuss implementation of bidirectional associative memories on various multiprocessor topologies. Our studies reveal that BAMs can be...

a r t i c l e i n f o a b s t r a c t The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G = (V , E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V |. In this paper, we show that the hierarchical hypercube network is bipancyclic.