Construction Compressed Quadtree into M-Dimensional Crossed Cubes via the Embedding

In parallel computing, an optimal graph embedding is to map nodes and edges of a guest graph onto nodes and paths of a host graph. Quadtrees are an important technique to present spatial based on the principle of recursive decomposition of space. We describe an efficient function to construct a compressed quadtree in crossed cubes topology using embedding technique. Our algorithm takes dilation as principle criteria for determining embedding efficiency.