A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree (Q3066464)
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 5834511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree |
scientific article; zbMATH DE number 5834511 |
Statements
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree (English)
0 references
10 January 2011
0 references
most reliable source
0 references
ring-tree
0 references
underlying topology
0 references
divide-and-conquer algorithm
0 references
0.9855111241340636
0 references
0.893186092376709
0 references
0.827531099319458
0 references
0.824414849281311
0 references
0.8115190863609314
0 references
