An advanced study of construction of independent spanning trees for Hierarchical Crossed Cubes:
碩士 === 國立東華大學 === 資訊工程學系 === 104 === A topology of a interconnection network is usually denoted by a graph where nodes represent processors and edges represent links between processors. If all the trees are rooted at the same node r and for any other node v(̸= r), the paths from v to r in any two tr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/88319608550474540597 |