Embedding of Hypercube into Fractal Cubic Network

Abstract

The implementation of parallel algorithms and the simulation of interconnection networks can be modeled into a graph embedding problem. Several cost parameters are used to assess the quality of an embedding. The wirelength is one of these factors that is frequently taken into account. A fractal cubic network is a new variant of the hypercube graph. In this study, we compute the wirelength of an embedding of the hypercube [Formula: see text] into the fractal cubic network [Formula: see text] using [Formula: see text]-partition.