Place of publishing:
Subject and Keywords:
The current paper presents a set of algorithms for finding minimal path and cut sets of various types in graph-structured networks (computer, telecommunication, transportation, etc.) Those sets are crucial in reliability analysis of network systems. The presented methodology is based on the construction of the acyclic paths tree, where each path connects two nodes of the considered network. Based on this tree the s-t minimal paths are readily obtained, and after minor transformations the so-called simplified fault tree is constructed from which the s-t minimal cuts are determined. In consequence, we have a common starting point for finding both the s-t path and cut sets, while many existing algorithms use very different approaches for paths and cuts.
Language of abstract:
Projects co-financed by:
Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.
This content is hosted outside the digital library.
Click the link below to view the content.https://www.ibspan.waw.pl/~alex/OZwRCIN/WA777_115244_RB-2011-18_Determining%20s-t%20and%20K-Terminal%20Path%20Sets%20and%20Cut%20Sets%20in%20Graph-Modeled%20Networks%20by%20a%20Unified%20Approach_content.pdf