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

Wei-Chang Yeh. A new algorithm for generating minimal cut sets in k-out-of-n networks. Rel. Eng. & Sys. Safety, 91(1):36-43, 2006. [doi]

@article{Yeh06-2,
  title = {A new algorithm for generating minimal cut sets in k-out-of-n networks},
  author = {Wei-Chang Yeh},
  year = {2006},
  doi = {10.1016/j.ress.2004.11.020},
  url = {http://dx.doi.org/10.1016/j.ress.2004.11.020},
  researchr = {https://researchr.org/publication/Yeh06-2},
  cites = {0},
  citedby = {0},
  journal = {Rel. Eng. & Sys. Safety},
  volume = {91},
  number = {1},
  pages = {36-43},
}