A note on boundingk-terminal reliability |
| |
| Authors: | Charles J Colbourn |
| |
| Affiliation: | (1) Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada |
| |
| Abstract: | A generalization of a theorem of Lomonosov and Polesskii is proved, which provides a novel method for determining upper bounds on the probability that a graph contains a Steiner tree (k-terminal reliability).This research was supported by NSERC Canada under Grant No. A0579. |
| |
| Keywords: | k-Terminal reliability Steiner tree Reliability bound Graph transformation Graph reduction |
| 本文献已被 SpringerLink 等数据库收录！ |
