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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
