Computing the lengths of shortest paths in \(Z^ n\) (Q4026306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 124663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the lengths of shortest paths in \(Z^ n\) |
scientific article; zbMATH DE number 124663 |
Statements
21 February 1993
0 references
linear algorithm
0 references
lengths of shortest paths
0 references
0.90293694
0 references
0.88941556
0 references
0 references
0.88156354
0 references
0.8762879
0 references
0 references
0 references
Computing the lengths of shortest paths in \(Z^ n\) (English)
0 references