On the number of shortest paths by neighborhood sequences on the square grid

DOI10.18514/MMN.2020.2790zbMath1463.68137MaRDI QIDQ4968952

Benedek Nagy

Publication date: 2 October 2020

Published in: Miskolc Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

shortest pathsdigital geometryenumerative combinatoricspath countingneighborhood sequencesdigital distancesoctagonal distances\(B\)-distances

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

Non-traditional 2D grids in combinatorial imaging -- advances and challenges

This page was built for publication: On the number of shortest paths by neighborhood sequences on the square grid