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): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321707.321712 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061135810 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:55, 19 March 2024
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
