1979
DOI: 10.1007/bf01069854
|View full text |Cite
|
Sign up to set email alerts
|

An approach to determining the minimum cut-set of a graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…To solve this problem, MCSs are used to distinguish the states of SRS. Thus, the computational cost mainly depends on the complexity of solving the MCSs of SRS, a problem that has been extensively studied in the literature [27][28][29]. Even in 1999, a system with 82 components, and as a result 12720 MCSs, can be solved within three minutes [32].…”
Section: Maintenance Policymentioning
confidence: 99%
See 1 more Smart Citation
“…To solve this problem, MCSs are used to distinguish the states of SRS. Thus, the computational cost mainly depends on the complexity of solving the MCSs of SRS, a problem that has been extensively studied in the literature [27][28][29]. Even in 1999, a system with 82 components, and as a result 12720 MCSs, can be solved within three minutes [32].…”
Section: Maintenance Policymentioning
confidence: 99%
“…MCS has been extensively studied in the literature [27][28][29], and a system"s MCSs can be obtained by many tools such as RAM commander, CAFTA and BlockSim [30]. For the same SRS, FD and FS states may have different MCSs.…”
Section: The Distribution Of States Of Srs According To Ugfmentioning
confidence: 99%