A new \(O(n^ 2)\) shortest chain algorithm (Q911302)
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: Publication:911302 |
scientific article; zbMATH DE number 4141518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new \(O(n^ 2)\) shortest chain algorithm |
scientific article; zbMATH DE number 4141518 |
Statements
A new \(O(n^ 2)\) shortest chain algorithm (English)
0 references
1990
0 references
shortest chain algorithm
0 references
network
0 references
0.7855606079101562
0 references
0.7789247632026672
0 references
0.7787657976150513
0 references
0.7740698456764221
0 references
0.7711318135261536
0 references
