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

DOI10.18514/MMN.2020.2790MaRDI QIDQ4968952zbMATH OpenFDO

Authors Benedek Nagy

Publication date 2 October 2020

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

Full work available at URL https://doi.org/10.18514/MMN.2020.2790

zbMATH Keywords

\(B\)-distancesdigital distancesdigital geometryenumerative combinatoricsneighborhood sequencesoctagonal distancespath countingshortest paths

Mathematics Subject Classification ID

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

Recommendations

• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
• An algorithm for finding the number of shortest routes on square lattices
• Asymptotic results for the number of paths in a grid
• The number of shortest paths in the arrangement graph
• Approximating the longest paths in grid graphs
• On path-pairability of the finite grids
• Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids
• Shortest paths in Sierpiński graphs
• On approximating node-disjoint paths in grids

Cited in

(7)

• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
• An algorithm for computing the number of the minimal paths in digital images
• Counting minimal 18-paths in 3D digital space
• Enumeration of shortest isothetic paths inside a digital object
• An algorithm for finding the number of shortest routes on square lattices
• An Arithmetic Triangle Arising From a One-Way Street Grid
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968952)