Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
52. An Algorithm to Find Minimal Cut-Sets of Complex Network
verfasst von : G. S. Prashanth, P. Manjunatha
Erschienen in: Proceedings of International Conference on VLSI, Communication, Advanced Devices, Signals & Systems and Networking (VCASAN-2013)
Verlag: Springer India
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Network reliability analysis is usually based on minimal path or cut enumeration from which the associated reliability expressions are deduced. The cut-set method is a popular approach in the reliability analysis of many systems from simple configurations to complex configurations. The computational requirements necessary to determine the minimal cut-sets of a network depend mainly on the complexity of the system. A new algorithm is presented in this paper to determine the minimal cut-sets. This algorithm can handle both simple and complex networks and considers both unidirectional and bidirectional branches. The applicability of the proposed technique is illustrated by application to a more complicated system.