Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Dynamic programming on tree decompositions is often a key for solving a widerange of optimization problems that would otherwise be intractable. Operations on tree decompositions are amenable to parallelization. However, a systematic approach towards such parallelization is still lacking. In this wor...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/6738 https://doi.org/10.26756/th.2017.32 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513480663498752 |
|---|---|
| author | Yassine, Mohamad M. |
| author_facet | Yassine, Mohamad M. |
| author_role | author |
| dc.creator.none.fl_str_mv | Yassine, Mohamad M. |
| dc.date.none.fl_str_mv | 2017-12-08T08:16:23Z 2017-12-08T08:16:23Z 2017 2017-12-08 2017-08-21 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/6738 https://doi.org/10.26756/th.2017.32 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Lebanese American University |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Lebanese American University -- Dissertations Dissertations, Academic Dynamic programming Trees (Graph theory) -- Data processing Parallel algorithms |
| dc.title.none.fl_str_mv | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| dc.type.none.fl_str_mv | Thesis info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | Dynamic programming on tree decompositions is often a key for solving a widerange of optimization problems that would otherwise be intractable. Operations on tree decompositions are amenable to parallelization. However, a systematic approach towards such parallelization is still lacking. In this work, we present a generic and flexible framework for parallel dynamic programming on tree decompositions that can be easily adapted to solve any graph theoretic optimization problem on graphs of bounded treewidth. We show the effectiveness of our framework using the Dominating Set problem as a case study. Our experiments show notable speedups compared to the serial approach. |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | LAURepo_88a3e3a0ee48bb20a71ccc9274a42d4e |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/6738 |
| publishDate | 2017 |
| publisher.none.fl_str_mv | Lebanese American University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)Yassine, Mohamad M.Lebanese American University -- DissertationsDissertations, AcademicDynamic programmingTrees (Graph theory) -- Data processingParallel algorithmsDynamic programming on tree decompositions is often a key for solving a widerange of optimization problems that would otherwise be intractable. Operations on tree decompositions are amenable to parallelization. However, a systematic approach towards such parallelization is still lacking. In this work, we present a generic and flexible framework for parallel dynamic programming on tree decompositions that can be easily adapted to solve any graph theoretic optimization problem on graphs of bounded treewidth. We show the effectiveness of our framework using the Dominating Set problem as a case study. Our experiments show notable speedups compared to the serial approach.N/A1 hard copy: ix, 49 leaves; 30 cm. available at RNL.Bibliography : leaves 47-49.Lebanese American University2017-12-08T08:16:23Z2017-12-08T08:16:23Z20172017-12-082017-08-21Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/6738https://doi.org/10.26756/th.2017.32http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.phpeninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/67382021-03-19T10:43:18Z |
| spellingShingle | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) Yassine, Mohamad M. Lebanese American University -- Dissertations Dissertations, Academic Dynamic programming Trees (Graph theory) -- Data processing Parallel algorithms |
| status_str | publishedVersion |
| title | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| title_full | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| title_fullStr | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| title_full_unstemmed | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| title_short | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| title_sort | Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) |
| topic | Lebanese American University -- Dissertations Dissertations, Academic Dynamic programming Trees (Graph theory) -- Data processing Parallel algorithms |
| url | http://hdl.handle.net/10725/6738 https://doi.org/10.26756/th.2017.32 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |