An efficient parallel strategy for computing K-terminal reliability and finding most vital edge in 2-trees and partial 2-trees

Chin-Wen Ho, S. Hsieh, Gen-Huey Chen
{"title":"An efficient parallel strategy for computing K-terminal reliability and finding most vital edge in 2-trees and partial 2-trees","authors":"Chin-Wen Ho, S. Hsieh, Gen-Huey Chen","doi":"10.1109/IPPS.1997.580963","DOIUrl":null,"url":null,"abstract":"The authors develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. They also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. The algorithms take O(log n) time with C(m,n) processors on a CRCW PRAM, where C(m,n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time.","PeriodicalId":145892,"journal":{"name":"Proceedings 11th International Parallel Processing Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1997.580963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The authors develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. They also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. The algorithms take O(log n) time with C(m,n) processors on a CRCW PRAM, where C(m,n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time.
一种计算2-树和部分2-树中k端可靠性和寻找最重要边的有效并行策略
提出了一种计算2树和部分2树k端可靠性的并行策略。他们还解决了在部分2树中找到关于k端可靠性的最重要边的问题。这些算法在CRCW PRAM上使用C(m,n)个处理器需要O(log n)时间,其中C(m,n)是在对数时间内找到具有m条边和n个顶点的图的连接组件所需的处理器数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信