Note on bounding k-terminal reliability

Research output: Contribution to journalArticle

1 Citation (Scopus)

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

Original languageEnglish (US)
Pages (from-to)303-307
Number of pages5
JournalAlgorithmica (New York)
Volume7
Issue number2-3
StatePublished - 1992
Externally publishedYes

Fingerprint

Steiner Tree
Upper bound
Graph in graph theory
Theorem
Generalization

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this

Note on bounding k-terminal reliability. / Colbourn, Charles.

In: Algorithmica (New York), Vol. 7, No. 2-3, 1992, p. 303-307.

Research output: Contribution to journalArticle

@article{ad892fe6bf0f43b6ad4f09223b5bc81b,
title = "Note on bounding k-terminal reliability",
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).",
author = "Charles Colbourn",
year = "1992",
language = "English (US)",
volume = "7",
pages = "303--307",
journal = "Algorithmica (New York)",
issn = "0178-4617",
publisher = "Springer New York",
number = "2-3",

}

TY - JOUR

T1 - Note on bounding k-terminal reliability

AU - Colbourn, Charles

PY - 1992

Y1 - 1992

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

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

UR - http://www.scopus.com/inward/record.url?scp=0026745668&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026745668&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0026745668

VL - 7

SP - 303

EP - 307

JO - Algorithmica (New York)

JF - Algorithmica (New York)

SN - 0178-4617

IS - 2-3

ER -