Khalid Housni
Ibn Tofail University Kenitra

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Enumeration of the minimal node cutsets based on necessary minimal paths Yasser Lamalem; Khalid Housni; Samir Mbarki
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 9, No 2: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (254.647 KB) | DOI: 10.11591/ijai.v9.i2.pp175-182

Abstract

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.