Algorithms for Finding Vertex-disjoint Paths and Edge-disjoint Spanning Trees in Star Graph Interconnection Networks Work Management System
碩士 === 逢甲大學 === 資訊工程研究所 === 82 ===
Main Authors: | Hon, Min Hor, 洪明豪 |
---|---|
Other Authors: | Hwang, Sho Fen |
Format: | Others |
Language: | en_US |
Published: |
1994
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47729401399593481665 |
Similar Items
-
Edge-disjoint Spanning Trees on Product Networks
by: Ting-Kai Hung, et al.
Published: (2000) -
Finding Edge-Disjoint Spanning Trees in General Chordal Rings
by: Hao-cheng Wang, et al.
Published: (2011) -
Constructing Vertex-disjoint Paths in Alternating Group Graphs
by: Lee Wen Hui, et al.
Published: (2014) -
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks
by: Chi-Lei-Liu, et al.
Published: (2008) -
Computing k-vertex Connectivity and Disjoint s-t Paths on Permutation Graphs
by: Yi-Wen Chen, et al.
Published: (1994)