Finding the Lengths of All Shortest paths in <i>N</i> -Node Nonnegative-Distance Complete Networks Using ½ <i> N <sup>3</sup> </i> Additions and <i> N <sup>3</sup> </i> Comparisons (Q5653927)
From MaRDI portal
scientific article; zbMATH DE number 3383888
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Lengths of All Shortest paths in <i>N</i> -Node Nonnegative-Distance Complete Networks Using ½ <i> N <sup>3</sup> </i> Additions and <i> N <sup>3</sup> </i> Comparisons |
scientific article; zbMATH DE number 3383888 |
Statements
Finding the Lengths of All Shortest paths in <i>N</i> -Node Nonnegative-Distance Complete Networks Using ½ <i> N <sup>3</sup> </i> Additions and <i> N <sup>3</sup> </i> Comparisons (English)
0 references
1972
0 references
