An algorithm for finding the number of shortest routes on square lattices
Given an m×n square lattice. The number of shortest routes from lower left corner of the lattice to the upper right corner is (Formula presented.). Usually, when some line segments of the lattice are deleted, the number of shortest routes could be obtained by using inclusion-exclusion principle. How...
Saved in:
| Main Author: | |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349158014&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61221 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |