Enumeration of the minimal node cutsets based on necessary minimal paths

Reliability evaluation is an important research field for a complex network. The most popular methods for such evaluation often use Minimal Cuts (MC) or Minimal paths (MP). Nonetheless, few algorithms address the issue of the enumeration of all minimal cut sets from the source node s to the terminal...

Full description

Saved in:
Bibliographic Details
Published inIAES International Journal of Artificial Intelligence Vol. 9; no. 2; p. 175
Main Authors Lamalem, Yasser, Housni, Khalid, Mbarki, Samir
Format Journal Article
LanguageEnglish
Published Yogyakarta IAES Institute of Advanced Engineering and Science 01.06.2020
Subjects
Algorithms
Enumeration
Network reliability
Nodes
Reliability analysis
Online AccessGet full text

Cover

More Information
Summary:Reliability evaluation is an important research field for a complex network. The most popular methods for such evaluation often use Minimal Cuts (MC) or Minimal paths (MP). Nonetheless, few algorithms address the issue of the enumeration of all minimal cut sets from the source node s to the terminal node t when only the nodes of the network are subject to random failures. This paper presents an effective algorithm which enumerates all minimal node cuts sets of a network. The proposed algorithm runs in two steps: The first one is used to generate a subset of paths, called necessary minimal paths, instead of all minimal paths. Whereas, the second step stands to build all minimal cutsets from the necessary minimal paths.
ISSN:2089-4872
2252-8938
2089-4872
DOI:10.11591/ijai.v9.i2.pp175-182