All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (Q2559493)
From MaRDI portal
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
