Seat arrangement problems
© 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/41667 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-41667 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-416672017-09-28T04:22:38Z Seat arrangement problems Longani V. Yingtaweesittikul H. © 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. 2017-09-28T04:22:38Z 2017-09-28T04:22:38Z 2016-08-01 Journal 16860209 2-s2.0-84985905527 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/41667 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| description |
© 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. |
| format |
Journal |
| author |
Longani V. Yingtaweesittikul H. |
| spellingShingle |
Longani V. Yingtaweesittikul H. Seat arrangement problems |
| author_facet |
Longani V. Yingtaweesittikul H. |
| author_sort |
Longani V. |
| title |
Seat arrangement problems |
| title_short |
Seat arrangement problems |
| title_full |
Seat arrangement problems |
| title_fullStr |
Seat arrangement problems |
| title_full_unstemmed |
Seat arrangement problems |
| title_sort |
seat arrangement problems |
| publishDate |
2017 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/41667 |
| _version_ |
1681422044394160128 |