Embedding of complete binary trees into meshes with row-column routing

This paper considers the problem of embedding complete binary trees into meshes using the row-column routing and obtained the following results: a complete binary tree with 2^p-1 nodes can be embedded (1) with link congestion one into a ⁹/₈√(2^p)×⁹/ ₈√(2^p) mesh when p is even and a √( ⁹/₈2^p)×√(⁹/ ₈2^p) mesh when p is odd, and (2) with link congestion two into a √(2^p)×√(2^p) mesh when p is even, and a √(2^p-1)×√(2^p-1) mesh when p is odd