A note on bounding k-terminal reliability

Charles J. Colbourn

doi:10.1007/BF01758764

A note on bounding k-terminal reliability

Charles J. Colbourn

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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 language	English (US)
Pages (from-to)	303-307
Number of pages	5
Journal	Algorithmica
Volume	7
Issue number	1-6
DOIs	https://doi.org/10.1007/BF01758764
State	Published - Jun 1992
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Computer Science(all)
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/BF01758764

Cite this

@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, Reliability bound, Steiner tree, k-Terminal reliability",

author = "Colbourn, {Charles J.}",

year = "1992",

month = jun,

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

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 - Reliability bound

KW - Steiner tree

KW - 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

U2 - 10.1007/BF01758764

DO - 10.1007/BF01758764

M3 - Article

AN - SCOPUS:52449147089

SN - 0178-4617

VL - 7

SP - 303

EP - 307

JO - Algorithmica (New York)

JF - Algorithmica (New York)

IS - 1-6

ER -

A note on bounding k-terminal reliability

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this