A New Node-Based Algorithm for Identifying the Complete Minimal Cut Set
The binary-state network, which is fundamental to several modern systems, only operates in two states: operational or inoperable. Network reliability is crucial in its planning, design, and evaluation, with the minimal cut (MC) being a cornerstone for reliability algorithms. A recursive binary-addit...
Main Authors: | Wei-Chang Yeh, Guangyi Yang, Chia-Ling Huang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-02-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/13/3/603 |
Similar Items
-
Reliability of Social Networks on Activity-on-Node Binary-State with Uncertainty Environments
by: Wei-Chang Yeh, et al.
Published: (2022-09-01) -
Binary-Addition Tree Algorithm-Based Resilience Assessment for Binary-State Network Problems
by: Yi-Zhu Su, et al.
Published: (2020-07-01) -
Predicting and Modeling Wildfire Propagation Areas with BAT and Maximum-State PageRank
by: Wei-Chang Yeh, et al.
Published: (2020-11-01) -
Minimal Cut Sets and the Use of Failure Modes in Metabolic Networks
by: Sangaalofa T. Clark, et al.
Published: (2012-09-01) -
A Comparative Analysis* of Pakistan’s External Debt Performance in Two Eras Democratic Era (FY1989-FY1999) & Military Era (FY1999-FY2007)
by: Syed Irfan Ahmed, et al.
Published: (2008-12-01)