On Network Reliability
The all terminal reliability of a graph G is the probability that at least a spanning tree is operational, given that vertices are always operational and edges independently operate with probability p in [0,1]. In this thesis, an investigation of all terminal reliability is undertaken. An open probl...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10222/27775 |