The twisted cube is an important variant of the most popular hypercube network for parallel processing. In this paper, we consider the problem of embedding multi-dimensional meshes into twisted cubes in a systematic way. We present a recursive method for embedding a family of disjoint multi-dimensio
Isometric embeddings into cube-hypergraphs
โ Scribed by Gustav Burosch; Pier Vittorio Ceccherini
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 412 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
We define the t-uniform cube-hypergraphs of dimension n, Q(n, t), and give two characterizations of those t-uniform hypergraphs isometrically embeddable into Q(t,n). This extends previous results of Djokovic (1973) and of Graham and Winkler (1984, 1985) for graphs.
๐ SIMILAR VOLUMES
Let n 2, let K, K be fields such that K is a quadratic Galoisextension of K and let ฮธ denote the unique nontrivial element in Gal(K /K). Suppose the symplectic dual polar space DW (2n -1, K) is fully and isometrically embedded into the Hermitian dual polar space DH(2n -1, K , ฮธ). We prove that the p
The proposed all-optical 2-D switching networks are (i) M รN -gon prism switches (M ยฟ2; Nยฟ3) and (ii) 3-D grids of any geometry N ยฟ3. For the routing we assume (1) the projection of the spatial architectures onto plane graphs (2) the embedding of the latter guest graphs into (in)complete host hyperc