Abstract

The complete binary tree as an important network structure has long been investigated for parallel and distributed computing, which has many nice properties and used to be embedded into other interconnection architectures. The parity cube is an important variant of the hypercube. It has many attractive features superior to those of the hypercube. In this paper, we prove that the complete binary tree with $$2^n-1$$ 2 n - 1 vertices can be embedded with dilation 1, congestion 1, load 1 into the $$n$$ n -dimensional parity cube $$PQ_n$$ P Q n and expansion tending to 1. Furthermore, we provide an $$O(NlogN)$$ O ( N l o g N ) algorithm to construct the complete binary tree with $$2^n-1$$ 2 n - 1 vertices in $$PQ_n$$ P Q n , where $$N$$ N denotes the number of vertices in $$PQ_n$$ P Q n and $$n\ge 1$$ n ? 1 .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.