Computing the \(K\)-terminal reliability of directed path graphs (Q2348708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6445936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the \(K\)-terminal reliability of directed path graphs |
scientific article; zbMATH DE number 6445936 |
Statements
Computing the \(K\)-terminal reliability of directed path graphs (English)
0 references
15 June 2015
0 references
algorithms
0 references
\(K\)-terminal reliability
0 references
directed path graphs
0 references
rooted directed path graphs
0 references
0.92240655
0 references
0.9005256
0 references
0.8807862
0 references
0.8781865
0 references
0.8729043
0 references
0.8674731
0 references
0.8659973
0 references
