Results 101 to 110 of about 5,839 (198)

Embedding 2-Dimensional Grids Into Optimal Hypercubes With Edge-Congestion 1 Or 2

open access: yes, 1998
This paper explores one-to-one embeddings of 2-dimensional grids into hypercubes. It is shown that each 2-dimensional grid can be embedded with edge-congestion 2 into its optimal hypercube (the smallest hypercube with at least as many nodes as the grid).
Ulf-Peter Schroeder, Markus Röttger
core  

On Embedding Binary Trees into Hypercubes

open access: yes, 1997
Hypercubes are known to be able to simulate other structures such as grids and binary trees. It has been shown that an arbitrary binary tree can be embedded into a hypercube with constant expansion and constant dilation.
Woei-kae Chen, Matthias F. M. Stallmann
core  

Fault tolerance of hypercubes and folded hypercubes

open access: yes, 2014
NSFC [11301440, 11171279]; Xiamen University of Technology [YKJ12030R]; Foundation to the Educational Committee of Fujian [JA13240, JA13025, JA13034]; Natural Science Foundation of Fujian Province [2013J05006]; Natural Sciences Foundation of Guangxi ...
Guo, Litao, 郭晓峰, Guo, Xiaofeng
core  

An Enhanced Reconfigurable Embedding Scheme for Rings in Hypercubes

open access: yes, 1992
In this paper we present an enhanced version of a reported reconfigurable embedding scheme (i.e., DC scheme) that based on the idea of divide and conquer to efficiently embed even length rings in hypercubes.
McMillin, Bruce M., Liu, Junlin
core   +1 more source

Maximal hypercubes in Fibonacci and Lucas cubes

open access: yes, 2012
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1.
Mollard, Michel
core  

Home - About - Disclaimer - Privacy