Bounding all‐terminal reliability in computer networks

Charles J. Colbourn, Daryl D. Harms

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


Many bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the Ball‐Provan bounds. Computational results on these new bounds are also reported.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
Issue number1
StatePublished - 1988
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Bounding all‐terminal reliability in computer networks'. Together they form a unique fingerprint.

Cite this