Alsuwaiyel, M. H. (1993) Finding a Shortest Hamiltonian Path inside a Simple Polygon. J. of Information Processing Letters, 55. pp. 75-79.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/text_html.png)
| HTML 195Kb | |
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 195Kb |
| Item Type: | Article |
|---|---|
| Date: | 1993 |
| Date Type: | Publication |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Information and Computer Science Dept |
| Creators: | Alsuwaiyel, M. H. |
| ID Code: | 10646 |
| Deposited By: | MOHAMMAD HAMAD AL-SUWAIYEL |
| Deposited On: | 25 Jun 2008 15:03 |
| Last Modified: | 12 Apr 2011 13:15 |
Repository Staff Only: item control page