Embedding the Maximum Number of Congestion-Free Spanning Trees in Arrangement Graphs
碩士 === 逢甲大學 === 資訊工程學系 === 89 === It has been shown that the star graph is superior to the widely used hypercube, such as smaller degree, diameter, and average distance. However, a major practical difficulty of the star graph is its restriction on the number of nodes. The (n,k)-arrangemen...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20973566596347105767 |