Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Raport Badawczy = Research Report ; RB/8/2017
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
32 stron ; 21 cm ; Bibliografia s. 31-32
A new solution to the problem of finding all minimal d-cut-sets in a flow network with one source and one sink node is presented. According to the developed method, min-d-cut-sets are generated from min-τ-cut sets, where a τ-cut-set is a set of components whose removal or failure causes the source and sink to be topologically disconnected. A τ-cut-set is minimal if no its subset is a τ-cut-set. The method consists of two algorithms; the first one is applied if Φ(C)<2d, the second - if Φ(C)>=2d, where C is the min-τ-cut-set from which min-d-cut-sets are generated, and Φ(C) denotes the total flow capacity of C's components. This distinction results in quick generation of min-d-cut-sets without first having to find many non-d-cut sets or non-minimal d-cut-sets. The presented method is highly efficient, due to a number of technical improvements which include applying different algorithms for the cases Φ(C)<2d and Φ(C)>=2d, and an effective method of checking if the found min-d-cut set is a redundant one.
Raport Badawczy = Research Report
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
19 paź 2021
13 sty 2020
47
https://rcin.org.pl./publication/115380
Nazwa wydania | Data |
---|---|
RB-2017-08 : Malinowski Jacek : A new efficient method of enumerating all min-d-cut-sets in a flow network | 19 paź 2021 |
Bryndal, Tomasz
Malinowski, Jacek
Barszcz, Mariusz
Kiwiel, Krzysztof
Kiwiel, Krzysztof
Malinowski, Jacek