Computing Terminal Reliability in Multi-Tolerance, Circular-Arc and Circle Graphs
博士 === 國立臺北科技大學 === 電機工程研究所 === 105 === Let G be a probabilistic graph, in which the vertices fail independently with known probabilities. Let K represent a specified subset of vertices. The K-terminal reliability of G is defined as the probability that all vertices in K are connected. When |K|=2, t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/n6n4rr |