Embedding Algorithm between Folded Hypercube and HFH Network


KIPS Transactions on Computer and Communication Systems, Vol. 2, No. 4, pp. 151-154, Apr. 2013
10.3745/KTCCS.2013.2.4.151,   PDF Download:

Abstract

In this paper, we will analyze embedding between Folded Hypercube and HFH. We will show Folded Hypercube FQ₂n can be embedded into HFH(Cn, Cn) with dilation 4, expansion (CN)²/2²n and HFH(Cd, Cd) can be embedded into FQ₄d-₂with dilation O(d).


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. Jongseok, L. Hyeongok, K. S. Won, "Embedding Algorithm between Folded Hypercube and HFH Network," KIPS Transactions on Computer and Communication Systems, vol. 2, no. 4, pp. 151-154, 2013. DOI: 10.3745/KTCCS.2013.2.4.151.

[ACM Style]
Kim Jongseok, Lee Hyeongok, and Kim Sung Won. 2013. Embedding Algorithm between Folded Hypercube and HFH Network. KIPS Transactions on Computer and Communication Systems, 2, 4, (2013), 151-154. DOI: 10.3745/KTCCS.2013.2.4.151.