Faithful 1-Edge Fault Tolerant Graphs and Some Graph Algorithms on Series-Parallel Networks
博士 === 國立交通大學 === 資訊科學學系 === 86 === Three research topics are discussed in this study. These three issuesare the faithful edge fault tolerant graphs, algorithms for series-parallelnetworks and associated parallel algorithms. A graph $G^*$ is defined as$1...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83943597097788761772 |