New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem

Various real-life applications, for example, Internet of Things, wireless sensor networks, smart grids, transportation communication social and computer grid systems, are usually modeled as network structures. The binary-state composed (e.g., functioning or failed) components (arcs and/or nodes) is one the most popular two-terminal reliability a success probability that still can be calculated by verifying connectivity between two specific nodes an effective technique evaluating performance all types networks. To obtain complete information making better decisions, multi-terminal extends to node subset in which connected. In this study, new algorithm called all-multiterminal BAT proposed revising binary-addition-tree (BAT) layered-search (LSA) calculate reliabilities. efficiency effectiveness analyzed from perspective time complexity explained via numerical experiments solve problems.