O(n log n)-average-time algorithm for shortest network under a given topology (Q6183623)
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 7796016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | O(n log n)-average-time algorithm for shortest network under a given topology |
scientific article; zbMATH DE number 7796016 |
Statements
O(n log n)-average-time algorithm for shortest network under a given topology (English)
0 references
29 January 2024
0 references
0.9803324937820436
0 references
0.8033701181411743
0 references
0.7753328084945679
0 references
