DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10235
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChakraborty, Suparna-
dc.date.accessioned2023-04-08T06:07:56Z-
dc.date.available2023-04-08T06:07:56Z-
dc.date.issued2014-
dc.identifier.urihttp://www.ijpe-online.com/EN/10.23940/ijpe.14.7.p771.mag-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10235-
dc.description.abstractThe recent paper published in IJPE by Tripathy et al. [1] presented a new method based on self-generating, non-redundant and disjoint cutsets to evaluate the three important reliability measures, viz., two-terminal, all-terminal and k-terminal. Authors claim that their algorithm is much more efficient as it saves the overhead of disjointing process and redundant terms removal than the existing Sum-of-Disjoint-Product (SDP) form based algorithms available in the literature. However, we observe several discrepancies in the results generated by their proposed algorithm on the considered benchmark networks and even on the illustrative example taken to describe the algorithm.en_US
dc.language.isoenen_US
dc.publisherTotem Publisheren_US
dc.subjectEEEen_US
dc.subjectInterconnection Networksen_US
dc.titleComments on An Efficient Method based on Self-Generating Disjoint Minimal Cut-Sets for Evaluating Reliability Measures of Interconnection Networksen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


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