A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges (Q2905281)
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 6072520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges |
scientific article; zbMATH DE number 6072520 |
Statements
27 August 2012
0 references
most reliable source
0 references
ring-tree
0 references
underlying topology
0 references
divide-and-conquer algorithm
0 references
0 references
0 references
A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges (English)
0 references
0.9855111241340636
0 references
0.914349377155304
0 references
0.8462950587272644
0 references
0.8407958745956421
0 references
0.817960798740387
0 references
