Two construction schemes for 4-regular 2-fault tolerant hamiltonian graphs
碩士 === 中原大學 === 應用數學研究所 === 98 === An interconnection network connects the processors of a parallel computer. It is possible that processors and communication links fail in any interconnection network. Suppose a graph, which represents an interconnection network, is proved to be "highly" f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94918350025869104529 |