Embedding 2-Dimensional Grids Into Optimal Hypercubes With Edge-Congestion 1 Or 2
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
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
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
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
Random coverage from within with variable radii, and Johnson-Mehl cover times. [PDF]
Penrose MD, Higgs F.
europepmc +1 more source
A multimodal imaging dataset for quality grading of Canadian wild rice kernels using RGB and VNIR hyperspectral data. [PDF]
Sikiru Y, Erkinbaev C.
europepmc +1 more source
Incorporating Uncertainty in Machine Learning Models to Improve Early Detection of Flavescence Dorée: A Demonstration of Applicability. [PDF]
Nuzzi C, Saldi E, Negri I, Pasinetti S.
europepmc +1 more source
Characteristic polynomials, spectral-based Riemann-Zeta functions and entropy indices of n-dimensional hypercubes. [PDF]
Balasubramanian K.
europepmc +1 more source
Maximal hypercubes in Fibonacci and Lucas cubes
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
TinyScope: Lightweight Hyperspectral Tissue Classification Using TinyML Inference on a Single-board Computer. [PDF]
Rudro R, Ma L, Pruitt K, Fei B.
europepmc +1 more source

