Upper Bounds on Perfect Embedding Binary trees to Hypercubes
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === Both hypercubes and binary trees are well studied interconnection networks, because both of them have good properties. For example, hypercubes have properties of strong connectivity, low diameter, regularity and symmetry and they can also be embedded by many oth...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86638877168841969861 |