Optimal k-Fault-Tolerant Networks for Token Rings
博士 === 國立交通大學 === 資訊科學系 === 87 === Designing an optimal k-fault-tolerant network for token rings is equivalent to constructing an optimal k-hamiltonian graph, where k is a positive integer and corresponds to the number of faults. A graph G = (V, E) is k-hamiltonian i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17481949313611466953 |