Constructing independent spanning trees for hypercubes and locally twisted cubes
碩士 === 國立交通大學 === 應用數學系所 === 97 === The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages such as the increase of fault-tolerance and bandwidth. Thus the designs of multiple ISTs in several classes of networks have been widely investi...
Main Authors: | Liu, Yi-Jiun, 劉宜君 |
---|---|
Other Authors: | Chen, Chiu-Yuan |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/20919339127141912268 |
Similar Items
-
Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel
by: Yu-Huei Chang, et al.
Published: (2014) -
A Study of Independent Spanning Trees on Locally Twisted Cubes
by: Jia-Cian Lin, et al.
Published: (2010) -
A Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes
by: Ting-Jyun Yang, et al.
Published: (2014) -
Edge-Disjoint Spanning Trees in Locally Twisted Cubes
by: Chang-Jen Tu, et al.
Published: (2008) -
Independent Spanning Trees on Crossed Cubes
by: Jhen-Ding Wang, et al.
Published: (2014)