一种解决k端网络可靠性问题的有效方法

2016 3rd International Conference on Recent Advances in Information Technology (RAIT) Pub Date : 2016-03-03 DOI:10.1109/RAIT.2016.7507869

Sandeep Singh, Aman Verma, S. Chatterjee, V. Ramana

{"title":"一种解决k端网络可靠性问题的有效方法","authors":"Sandeep Singh, Aman Verma, S. Chatterjee, V. Ramana","doi":"10.1109/RAIT.2016.7507869","DOIUrl":null,"url":null,"abstract":"An efficient way of solving the K-terminal network reliability measure of a directed/undirected graphs using the method of ROBDD have been presented. In this paper, the breadth first search traversal order to enumerate the minimal paths and sum of disjoint products approach has been used to solve the probability calculation for K-vertices of the given network.","PeriodicalId":289216,"journal":{"name":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An efficient methodology to solve the K-terminal network reliability problem\",\"authors\":\"Sandeep Singh, Aman Verma, S. Chatterjee, V. Ramana\",\"doi\":\"10.1109/RAIT.2016.7507869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient way of solving the K-terminal network reliability measure of a directed/undirected graphs using the method of ROBDD have been presented. In this paper, the breadth first search traversal order to enumerate the minimal paths and sum of disjoint products approach has been used to solve the probability calculation for K-vertices of the given network.\",\"PeriodicalId\":289216,\"journal\":{\"name\":\"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAIT.2016.7507869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAIT.2016.7507869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

提出了一种利用ROBDD方法求解有向/无向图k端网络可靠性测度的有效方法。本文采用广度优先搜索遍历顺序枚举最小路径和不相交积和的方法解决了给定网络中k个顶点的概率计算问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient methodology to solve the K-terminal network reliability problem

An efficient way of solving the K-terminal network reliability measure of a directed/undirected graphs using the method of ROBDD have been presented. In this paper, the breadth first search traversal order to enumerate the minimal paths and sum of disjoint products approach has been used to solve the probability calculation for K-vertices of the given network.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 3rd International Conference on Recent Advances in Information Technology (RAIT)

自引率

0.00%

发文量