2015 IEEE International Conference on Cluster Computing

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

2015 IEEE International Conference on Cluster Computing

Title: 2015 IEEE International Conference on Cluster Computing;
Highly scalable parallel search-tree algorithms

Abu-Khzam, Faisal N.; Mouawad, Amer A.; Jahed, Karim A.; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb; Lebanese American University

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

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.