Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/24005
DC FieldValueLanguage
dc.contributor.authorMihova, Marijaen_US
dc.contributor.authorStojkovich, Natashaen_US
dc.date.accessioned2022-10-31T13:25:32Z-
dc.date.available2022-10-31T13:25:32Z-
dc.date.issued2011-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/24005-
dc.description.abstractOne of the hardest problems in two terminal networks reliability theory is to obtain minimal path or cut vectors of such a network. Moreover, the bigger problem is appeared when we have a network with cycles. Here we give one algorithm solution for such a problem.en_US
dc.relation.ispartofMathematica Balkanicaen_US
dc.titleEstimation of minimal path vectors of multi state two terminal networks with cycles controlen_US
dc.typeArticleen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles
Files in This Item:
File Description SizeFormat 
Micom.pdf141.19 kBAdobe PDFView/Open
Show simple item record

Page view(s)

42
checked on May 11, 2024

Download(s)

2
checked on May 11, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.