Metadata language
Raport Badawczy = Research Report ; RB/18/2011
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:22 pages ; 21 cm ; Bibliography p. 22
Subject and Keywords:Teoria grafów ; Graph theory ; Reliability analysis of network ; Analiza niezawodności systemów sieciowych ; S-t cut ; S-t cięcie ; Path sets ; Cut sets ; Zestawy ścieżek ; Zestawy cięć ; K-terminal
Abstract: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.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use:Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: