DSpace Repository

Comments on An Efficient Method based on Self-Generating Disjoint Minimal Cut-Sets for Evaluating Reliability Measures of Interconnection Networks

Show simple item record

dc.contributor.author Chakraborty, Suparna
dc.date.accessioned 2023-04-08T06:07:56Z
dc.date.available 2023-04-08T06:07:56Z
dc.date.issued 2014
dc.identifier.uri http://www.ijpe-online.com/EN/10.23940/ijpe.14.7.p771.mag
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10235
dc.description.abstract The 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.iso en en_US
dc.publisher Totem Publisher en_US
dc.subject EEE en_US
dc.subject Interconnection Networks en_US
dc.title Comments on An Efficient Method based on Self-Generating Disjoint Minimal Cut-Sets for Evaluating Reliability Measures of Interconnection Networks en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account