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 this page instead for the normal view: A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree |
scientific article |
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
