"Minimal cut sets of s-t networks with k-out-of-n nodes."

Zhibin Tan (2003)

> Home

Details and statistics

DOI: 10.1016/S0951-8320(03)00122-4

access: closed

type: Journal Article

metadata version: 2020-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ress/Tan03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ress/Tan03
Zhibin Tan:
Minimal cut sets of s-t networks with k-out-of-n nodes. Reliab. Eng. Syst. Saf. 82(1): 49-54 (2003)

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.