An algorithm for finding the number of shortest routes on square lattices

DOI10.1080/09720529.2007.10698126zbMath1124.05003OpenAlexW2334995935MaRDI QIDQ5421202

Vites Longani

Publication date: 22 October 2007

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2007.10698126

zbMATH Keywords

square latticegridshortest routes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (1)

An algorithm for the numbers of endomorphisms on paths (DM13208)

Cites Work

• Unnamed Item

This page was built for publication: An algorithm for finding the number of shortest routes on square lattices