Finding a Shortest Hamiltonian Path inside a Simple Polygon
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
1993
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/10646/1/distransform.pdf https://eprints.kfupm.edu.sa/id/eprint/10646/2/distransform.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513383748861952 |
|---|---|
| author | Alsuwaiyel, M. H. |
| author2 | unknown |
| author2_role | author |
| author_facet | Alsuwaiyel, M. H. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Alsuwaiyel, M. H. unknown |
| dc.date.none.fl_str_mv | 1993 2020 |
| dc.format.none.fl_str_mv | text/html application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/10646/1/distransform.pdf https://eprints.kfupm.edu.sa/id/eprint/10646/2/distransform.pdf (1993) Finding a Shortest Hamiltonian Path inside a Simple Polygon. J. of Information Processing Letters, 55. pp. 75-79. |
| dc.language.none.fl_str_mv | en en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/10646/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_b137ace0e52a7305e4e800034da9016a |
| identifier_str_mv | (1993) Finding a Shortest Hamiltonian Path inside a Simple Polygon. J. of Information Processing Letters, 55. pp. 75-79. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::10646 |
| publishDate | 1993 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Finding a Shortest Hamiltonian Path inside a Simple PolygonAlsuwaiyel, M. H.unknownComputer19932020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articletext/htmlapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/10646/1/distransform.pdfhttps://eprints.kfupm.edu.sa/id/eprint/10646/2/distransform.pdf (1993) Finding a Shortest Hamiltonian Path inside a Simple Polygon. J. of Information Processing Letters, 55. pp. 75-79. enenhttps://eprints.kfupm.edu.sa/id/eprint/10646/info:eu-repo/semantics/openAccessoai::106462019-11-01T14:03:22Z |
| spellingShingle | Finding a Shortest Hamiltonian Path inside a Simple Polygon Alsuwaiyel, M. H. Computer |
| status_str | publishedVersion |
| title | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| title_full | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| title_fullStr | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| title_full_unstemmed | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| title_short | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| title_sort | Finding a Shortest Hamiltonian Path inside a Simple Polygon |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/10646/1/distransform.pdf https://eprints.kfupm.edu.sa/id/eprint/10646/2/distransform.pdf |