A Fast Algorithm for Searching All Multi-State Minimal Cuts

@article{Yeh2008AFA,
  title={A Fast Algorithm for Searching All Multi-State Minimal Cuts},
  author={Wei-Chang Yeh},
  journal={IEEE Transactions on Reliability},
  year={2008},
  volume={57},
  pages={581-588}
}
Evaluating network reliability is an important topic in planning, designing, and control of systems. Many real-world systems are limited-flow (multi-state) networks composed of multi-state components, and their reliabilities can be computed in terms of minimal cut (MC) vectors to level d (named d-MC). A straightforward exact algorithm is presented here. The idea is to find all d-MC prior to calculating the limited-flow network reliability between the source, and the sink nodes (i.e. the one-to… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
16 Citations
25 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…