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 |
| id |
th-cmuir.6653943832-61221 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-612212018-09-10T04:06:56Z An algorithm for finding the number of shortest routes on square lattices V. Longani Mathematics 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. However, when the number of deleted segments increases, the amount of calculation could be quite laborious. In this paper we propose a simple algorithm for obtaining the number of shortest routes that require much less calculation when the number of deleted segments increases. © 2007 Taylor & Francis Group, LLC. 2018-09-10T04:06:56Z 2018-09-10T04:06:56Z 2007-01-01 Journal 09720529 2-s2.0-56349158014 10.1080/09720529.2007.10698126 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349158014&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61221 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics V. Longani An algorithm for finding the number of shortest routes on square lattices |
| description |
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. However, when the number of deleted segments increases, the amount of calculation could be quite laborious. In this paper we propose a simple algorithm for obtaining the number of shortest routes that require much less calculation when the number of deleted segments increases. © 2007 Taylor & Francis Group, LLC. |
| format |
Journal |
| author |
V. Longani |
| author_facet |
V. Longani |
| author_sort |
V. Longani |
| title |
An algorithm for finding the number of shortest routes on square lattices |
| title_short |
An algorithm for finding the number of shortest routes on square lattices |
| title_full |
An algorithm for finding the number of shortest routes on square lattices |
| title_fullStr |
An algorithm for finding the number of shortest routes on square lattices |
| title_full_unstemmed |
An algorithm for finding the number of shortest routes on square lattices |
| title_sort |
algorithm for finding the number of shortest routes on square lattices |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349158014&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61221 |
| _version_ |
1681425580324552704 |