An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees

DOI10.1006/JPDC.1998.1454zbMath0909.68093OpenAlexW2120511079MaRDI QIDQ1268797

Gen-Huey Chen, Chin-Wen Ho, Sun-Yuan Hsieh

Publication date: 30 March 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1454

zbMATH Keywords

Steiner trees\(K\)-terminal reliabilitySteiner minimal networks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

A note on integral generalized flows in directed partial 2-trees

This page was built for publication: An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees