A 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
Volume7
Issue number1-6
DOIs
StatePublished - Jun 1992
Externally publishedYes

Fingerprint

Steiner Tree
Upper bound
Graph in graph theory
Theorem
Generalization

Keywords

  • Graph reduction
  • Graph transformation
  • k-Terminal reliability
  • Reliability bound
  • Steiner tree

ASJC Scopus subject areas

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

Cite this

A note on bounding k-terminal reliability. / Colbourn, Charles.

In: Algorithmica, Vol. 7, No. 1-6, 06.1992, p. 303-307.

Research output: Contribution to journalArticle

Colbourn, Charles. / A note on bounding k-terminal reliability. In: Algorithmica. 1992 ; Vol. 7, No. 1-6. pp. 303-307.
@article{253f3da7e9424f00b6fb4141b49e7083,
title = "A 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).",
keywords = "Graph reduction, Graph transformation, k-Terminal reliability, Reliability bound, Steiner tree",
author = "Charles Colbourn",
year = "1992",
month = "6",
doi = "10.1007/BF01758764",
language = "English (US)",
volume = "7",
pages = "303--307",
journal = "Algorithmica (New York)",
issn = "0178-4617",
publisher = "Springer New York",
number = "1-6",

}

TY - JOUR

T1 - A note on bounding k-terminal reliability

AU - Colbourn, Charles

PY - 1992/6

Y1 - 1992/6

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

KW - Graph reduction

KW - Graph transformation

KW - k-Terminal reliability

KW - Reliability bound

KW - Steiner tree

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

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

U2 - 10.1007/BF01758764

DO - 10.1007/BF01758764

M3 - Article

AN - SCOPUS:52449147089

VL - 7

SP - 303

EP - 307

JO - Algorithmica (New York)

JF - Algorithmica (New York)

SN - 0178-4617

IS - 1-6

ER -