Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис:
http://hdl.handle.net/20.500.12188/24031
Наслов: | Analysis of an Algorithm for finding Minimal Cut Set for Undirected Network | Authors: | Mihova, Marija Stojkovich, Natasha |
Keywords: | Network, minimal cut set, cut set, undirected network, connected network, graph | Issue Date: | 2010 | Journal: | ICT Innovations 2010, Web proceedings | 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. | URI: | http://hdl.handle.net/20.500.12188/24031 |
Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles |
Files in This Item:
File | Опис | Size | Format | |
---|---|---|---|---|
ictinnovations2010_submission_9.pdf | 130.88 kB | Adobe PDF | View/Open |
Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.