A note on boundingk-terminal reliability


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).

DOI: 10.1007/BF01758764

Cite this paper

@article{Colbourn1992ANO, title={A note on boundingk-terminal reliability}, author={Charles J. Colbourn}, journal={Algorithmica}, year={1992}, volume={7}, pages={303-307} }