All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (Q2559493): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:34, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All shortest distances in a graph. An improvement to Dantzig's inductive algorithm |
scientific article |
Statements
All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (English)
0 references
1973
0 references
