On the number of shortest paths by neighborhood sequences on the square grid (Q4968952)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of shortest paths by neighborhood sequences on the square grid |
scientific article; zbMATH DE number 7254900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of shortest paths by neighborhood sequences on the square grid |
scientific article; zbMATH DE number 7254900 |
Statements
On the number of shortest paths by neighborhood sequences on the square grid (English)
0 references
2 October 2020
0 references
enumerative combinatorics
0 references
digital geometry
0 references
neighborhood sequences
0 references
octagonal distances
0 references
digital distances
0 references
shortest paths
0 references
path counting
0 references
\(B\)-distances
0 references
0 references
0.87546754
0 references
0.86693734
0 references
0.85434425
0 references
0.85367143
0 references
0.84514964
0 references
0.84513634
0 references
0 references
0.8404266
0 references
