An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology (Q1283683)
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: An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology |
scientific article; zbMATH DE number 1270892
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology |
scientific article; zbMATH DE number 1270892 |
Statements
An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology (English)
0 references
8 August 1999
0 references
Hwang-Weng algorithm
0 references
