@misc{Malinowski_Jacek_Determining_2011,
 author={Malinowski, Jacek},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2011},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 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.},
 title={Determining s-t and K-terminal path sets and cut sets in graph-modeled networks by a unified approach},
 type={Text},
 URL={http://rcin.org.pl/Content/102981/PDF/RB-2011-18.pdf},
 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},
}