Construction Compressed Octree Into M-Dimensional Crossed Cubes Via The One-By-One Embedding

In the field of parallel computing, achieving optimal graph embedding involves the task of mapping the nodes and edges of a guest graph onto the nodes and paths of a host graph. A widely employed approach for spatial representation is the utilization of octrees, which rely on recursive space decomposition. In this study, we present a highly efficient function for constructing a compressed octree in the crossed cubes topology using an embedding technique. Our algorithm prioritizes the measure of dilation as a criterion for evaluating embedding efficiency.