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

Chin Wen Ho, Sun Yuan Hsieh, Gen Huey Chen

研究成果: Conference article同行評審

摘要

We develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. We also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. Our 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.

原文English
頁(從 - 到)603-607
頁數5
期刊Proceedings of the International Parallel Processing Symposium, IPPS
出版狀態Published - 1997 一月 1
事件Proceedings of the 1997 11th International Parallel Processing Symposium, IPPS 97 - Geneva, Switz
持續時間: 1997 四月 11997 四月 5

All Science Journal Classification (ASJC) codes

  • 硬體和架構

引用此