An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (Q1268797)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees |
scientific article; zbMATH DE number 1216784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees |
scientific article; zbMATH DE number 1216784 |
Statements
An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (English)
0 references
30 March 1999
0 references
\(K\)-terminal reliability
0 references
Steiner trees
0 references
Steiner minimal networks
0 references
