1-Edge Fault-tolerant Designs for Meshes
碩士 === 國立交通大學 === 資訊科學學系 === 82 === Motivated by the study of computers and communication networks that tolerate failure of their components, some scholars recently formulated the concept of fault tolerance in graphs. A graph G* is k-edge f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78681281426183674523 |