Counting almost minimum cutsets with reliability applications

Aparna Ramanathan; Charles J. Colbourn

doi:10.1007/BF02592076

Counting almost minimum cutsets with reliability applications

Aparna Ramanathan, Charles J. Colbourn

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

28 Scopus citations

Abstract

The number n₁ of i-edge network cutsets in a graph is an important parameter in reliability analysis. Using a theorem of Lomonosov and Polesskii, Ball and Provan have shown that the number n_i of minimum cardinality network cutsets can be determined in polynomial time. This paper gives a polynomial time algorithm for determining n_r+k for any fixed k, as a special case of counting cuts of specified maximum weight in an edge-weighted graph. The resulting improvement in existing reliability bounds is shown to be substantial.

Original language	English (US)
Pages (from-to)	253-261
Number of pages	9
Journal	Mathematical Programming
Volume	39
Issue number	3
DOIs	https://doi.org/10.1007/BF02592076
State	Published - Oct 1 1987
Externally published	Yes

Keywords

Cutset
inclusion-exclusion
network reliability
polynomial time
probabilistic graph
weighted graph

ASJC Scopus subject areas

Software
Mathematics(all)

Access to Document

10.1007/BF02592076

Cite this

@article{cb413c79c63f40e991cf8046fb5e494e,

title = "Counting almost minimum cutsets with reliability applications",

abstract = "The number n1 of i-edge network cutsets in a graph is an important parameter in reliability analysis. Using a theorem of Lomonosov and Polesskii, Ball and Provan have shown that the number ni of minimum cardinality network cutsets can be determined in polynomial time. This paper gives a polynomial time algorithm for determining nr+k for any fixed k, as a special case of counting cuts of specified maximum weight in an edge-weighted graph. The resulting improvement in existing reliability bounds is shown to be substantial.",

keywords = "Cutset, inclusion-exclusion, network reliability, polynomial time, probabilistic graph, weighted graph",

author = "Aparna Ramanathan and Colbourn, {Charles J.}",

year = "1987",

month = oct,

day = "1",

doi = "10.1007/BF02592076",

language = "English (US)",

volume = "39",

pages = "253--261",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "3",

}

TY - JOUR

T1 - Counting almost minimum cutsets with reliability applications

AU - Ramanathan, Aparna

AU - Colbourn, Charles J.

PY - 1987/10/1

Y1 - 1987/10/1

N2 - The number n1 of i-edge network cutsets in a graph is an important parameter in reliability analysis. Using a theorem of Lomonosov and Polesskii, Ball and Provan have shown that the number ni of minimum cardinality network cutsets can be determined in polynomial time. This paper gives a polynomial time algorithm for determining nr+k for any fixed k, as a special case of counting cuts of specified maximum weight in an edge-weighted graph. The resulting improvement in existing reliability bounds is shown to be substantial.

AB - The number n1 of i-edge network cutsets in a graph is an important parameter in reliability analysis. Using a theorem of Lomonosov and Polesskii, Ball and Provan have shown that the number ni of minimum cardinality network cutsets can be determined in polynomial time. This paper gives a polynomial time algorithm for determining nr+k for any fixed k, as a special case of counting cuts of specified maximum weight in an edge-weighted graph. The resulting improvement in existing reliability bounds is shown to be substantial.

KW - Cutset

KW - inclusion-exclusion

KW - network reliability

KW - polynomial time

KW - probabilistic graph

KW - weighted graph

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

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

U2 - 10.1007/BF02592076

DO - 10.1007/BF02592076

M3 - Article

AN - SCOPUS:0023560289

SN - 0025-5610

VL - 39

SP - 253

EP - 261

JO - Mathematical Programming

JF - Mathematical Programming

IS - 3

ER -

Counting almost minimum cutsets with reliability applications

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this