Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 102 === Let LTQn denote the n-dimensional locally twisted cube. Hsieh and Tu [S.-Y. Hsieh and C.-J. Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science, 410 (2009) 926{932] presented an algorithm to construct n edg...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/38064489466544905074 |