Abstract
It is conjectured that an N-vertex binary tree can be embedded into a ⌈log N⌉-dimensional cube with a dilation of at most 2. Although it is known that an N-vertex binary tree can be embedded into a ⌈log N⌉-dimensional cube with a dilation of at most 8, the conjecture has been verified only for some restricted classes of binary trees. This paper verifies the conjecture for wider classes of binary trees. That is, we show that a 2n-vertex balanced one-legged caterpillar with leg length of at most 2 can be embedded into an n-dimensional cube with dilation 1, and that an N-vertex binary tree with proper pathwidth of at most 2 can be embedded into a ⌈log N⌉-dimensional cube with dilation 2. © 1999 Scripta Technica, Electron Comm Jpn Pt 3, 83(1): 1–13, 2000
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 callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
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.
