Constructing One-to-Many Disjoint Paths in Crossed Cubes
碩士 === 國立花蓮教育大學 === 學習科技研究所 === 97 === The performance of parallel architectures is affected by its network topology. Efficient and reliable routing is important to design a topology of interconnection networks. Finding disjoint paths in interconnection networks can be used to avoid communication bo...
Main Authors: | Ching-Kai Liao, 廖經凱 |
---|---|
Other Authors: | Chang-Hsiung Tsai |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/90384519979292840072 |
Similar Items
-
Many-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges
by: Mingzu Zhang, et al.
Published: (2021-01-01) -
A Study of Paired Many to Many Disjoint Path Cover Problem of the Hierarchical Crossed Cube
by: Yao-Zhang Yang, et al.
Published: (2014) -
Two Edge-Disjoint Hamiltonian Cycles and One Isometric Path Cover in Augmented Cubes
by: Chun-Kai Wang, et al.
Published: (2012) -
One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube
by: Cheng-Nan Lai, et al.
Published: (2001) -
The two-equal-disjoint path cover problem of the hierarchical crossed cube
by: Chih-Min Chien, et al.
Published: (2010)