Mihova, Marija and Stojkovic, Natasa (2010) Analysis of an Algorithm for finding Minimal Cut Set for Undirected Network. ICT Innovations 2010, Web proceedings. ISSN 1857-7288
Preview |
Text
ictinnovations2010_submission_9.pdf Download (134kB) | Preview |
Abstract
In this paper we propose an algorithm for obtaining all minimal cut
sets for a given two-terminal network. The algorithm works on undirected
networks without matter whether they are coherent or not. The difference
between this algorithm and the other proposed algorithms is in the fact that
there are not received candidates for minimal cut set that are not minimal cut
sets. A large part of the paper proves the correctness of the algorithm and
analyzes its complexity.
| Item Type: | Article |
|---|---|
| Subjects: | Natural sciences > Matematics |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Natasa Stojkovik |
| Date Deposited: | 05 Nov 2012 14:29 |
| Last Modified: | 30 Nov 2020 13:03 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/418 |
Actions (login required)
 |
View Item |