"A new algorithm for generating minimal cut sets in k-out-of-n networks."

Wei-Chang Yeh (2006)

> Home

Details and statistics

DOI: 10.1016/J.RESS.2004.11.020

access: closed

type: Journal Article

metadata version: 2024-06-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ress/Yeh06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ress/Yeh06
Wei-Chang Yeh:
A new algorithm for generating minimal cut sets in k-out-of-n networks. Reliab. Eng. Syst. Saf. 91(1): 36-43 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.