Highly scalable parallel search-tree algorithms

Abu-Khzam, Faisal N.; Mouawad, Amer A.; Jahed, Karim A.

Highly scalable parallel search-tree algorithms

Abu-Khzam, Faisal N.; Mouawad, Amer A.; Jahed, Karim A.

URI: http://hdl.handle.net/10725/5375

URL: http://ieeexplore.ieee.org/abstract/document/7307638/

DOI: http://dx.doi.org/10.1109/CLUSTER.2015.91

Date: 2017-03-16

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

Summary form only given. We introduce the notion of a virtual topology and explore the use of search-tree indexing to achieve highly scalable parallel search-tree algorithms for NP-hard problems. Vertex Cover and Cluster Editing are used as case studies.

Citation:

Abu-Khzam, F. N., Mouawad, A. E., & Jahed, K. A. (2015, September). Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach. In Cluster Computing (CLUSTER), 2015 IEEE International Conference on (pp. 518-518). IEEE.