A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2001
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/10651/1/minmaxdiam.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513383752007681 |
|---|---|
| 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 | 2001-05 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/10651/1/minmaxdiam.pdf (2001) A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 27 (6). pp. 861-865. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/10651/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| 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_d0fb4875cd527bdd776a38764843cf01 |
| identifier_str_mv | (2001) A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 27 (6). pp. 861-865. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::10651 |
| publishDate | 2001 |
| publisher.none.fl_str_mv | ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of DiametersAlsuwaiyel, M. H.unknownComputerACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS2001-052020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/10651/1/minmaxdiam.pdf (2001) A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 27 (6). pp. 861-865. enhttps://eprints.kfupm.edu.sa/id/eprint/10651/info:eu-repo/semantics/openAccessoai::106512019-11-01T14:03:24Z |
| spellingShingle | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters Alsuwaiyel, M. H. Computer |
| status_str | publishedVersion |
| title | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| title_full | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| title_fullStr | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| title_full_unstemmed | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| title_short | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| title_sort | A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/10651/1/minmaxdiam.pdf |