Name
Title | ||
|---|---|---|
An efficient parallel strategy for computing K-terminal reliability and finding most vital edges in 2-trees and partial 2-trees |
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1006/jpdc.1998.1454 | Journal of Parallel and Distributed Computing |
Keywords | DocType | Volume |
vital edge,logarithmic time,n vertex,k-terminal reliability,computing k-terminal reliability,efficient parallel strategy,m edge,log n,partial 2-trees,parallel strategy,crcw pram,computational complexity,reliability,concurrent computing,connected component,computer networks,computer science,tree graphs,processors,np hard problem,edges,reliability engineering,parallel algorithms,vertices | Journal | 51 |
Issue | ISSN | ISBN |
2 | 0743-7315 | 0-8186-7792-9 |
Citations | PageRank | References |
1 | 0.38 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chin-Wen Ho | 1 | 573 | 39.27 |
| Sun-Yuan Hsieh | 2 | 1715 | 112.85 |
| Gen-Huey Chen | 3 | 979 | 89.32 |