Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: 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 Опис SizeFormat 
Micom.pdf141.19 kBAdobe PDFView/Open
Прикажи едноставен запис

Page view(s)

63
checked on 3.5.2025

Download(s)

11
checked on 3.5.2025

Google ScholarTM

Проверете


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.