Network Reliability Algorithms

Network Reliability Algorithms is a class of graph algorithms that computes the probability of connectivity between specified nodes in a network under random edge or node failures, distinguishing it from general graph traversal or optimization methods by focusing on probabilistic robustness and structural survivability.

518

Publications

22.9K

Citations

931

Authors

459

Institutions

Publications per year

2017–2026

95

Authors

931

  1. WY
    Wei‐Chang Yeh

    National Tsing Hua University, Taiwan

    38 publications · 1.6K citations

    23

    h-index

  2. YL
    Yi‐Kuei Lin

    National Taiwan University of Science and Technology, Taiwan

    18 publications · 1K citations

    16

    h-index

  3. MF
    Majid Forghani-elahabad

    Universidade Federal do ABC, Brazil

    9 publications · 322 citations

    9

    h-index

  4. AS
    A. Satyanarayana

    Stevens Institute of Technology, United States

    9 publications · 678 citations

    9

    h-index

  5. JT
    János Tapolcai

    Budapest University of Technology and Economics, Hungary

    7 publications · 157 citations

    7

    h-index

1–5 of 931

Venues

  1. IEEE Transactions on Reliability

    106 publications · 6K citations

    44

    h-index

  2. Reliability Engineering & System Safety

    37 publications · 1.3K citations

    23

    h-index

  3. Networks

    23 publications · 1K citations

    18

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 11 publications · 762 citations

    11

    h-index

  5. Theoretical Computer Science

    8 publications · 210 citations

    8

    h-index

1–5