- Tytuł:
-
Raport Badawczy = Research Report ; RB/18/2011
Determining s-t and K-terminal path sets and cut sets in graph-modeled networks by a unified approach - Autorzy:
- Malinowski, Jacek
- Wydawca:
-
Instytut Badań Systemowych. Polska Akademia Nauk
Systems Research Institute. Polish Academy of Sciences - Powiązania:
- Raport Badawczy = Research Report
- Opis:
-
22 pages ; 21 cm
22 stron ; 21 cm
Bibliografia s. 22
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.
Bibliography p. 22 - Dostawca treści:
- RCIN - Repozytorium Cyfrowe Instytutów Naukowych
Książka