Minimal Cut Sets

Minimal Cut Sets is a formal construct in network reliability theory that denotes a minimal collection of component failures whose simultaneous occurrence results in the disconnection of source-sink communication, distinguishing it from non-minimal cut sets by the irreducibility of its constituent failure components.

248

Publications

10.5K

Citations

546

Authors

286

Institutions

Publications per year

2017–2026

51

Authors

546

  1. SK
    Steffen Klamt

    Max Planck Institute for Dynamics of Complex Technical Systems, Germany

    10 publications · 870 citations

    10

    h-index

  2. RB
    R. Billinton

    University of Saskatchewan, Canada

    7 publications · 270 citations

    7

    h-index

  3. CJ
    Christian Jungreuthmayer

    Austrian Centre of Industrial Biotechnology (Austria), Austria

    5 publications · 95 citations

    5

    h-index

  4. AV
    Axel von Kamp

    Max Planck Institute for Dynamics of Complex Technical Systems, Germany

    5 publications · 300 citations

    5

    h-index

  5. JZ
    Jürgen Zanghellini

    Austrian Centre of Industrial Biotechnology (Austria), Austria

    5 publications · 95 citations

    5

    h-index

1–5 of 546

Venues

  1. IEEE Transactions on Reliability

    39 publications · 1.9K citations

    24

    h-index

  2. Reliability Engineering & System Safety

    12 publications · 460 citations

    12

    h-index

  3. Bioinformatics

    10 publications · 547 citations

    10

    h-index

  4. 8

    h-index

  5. Mathematics of Operations Research

    5 publications · 489 citations

    5

    h-index

1–5