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.
|Number of pages||1|
|Publication status||Published - 2015|
|Event||IEEE International Conference on Cluster Computing, CLUSTER 2015 - Chicago, United States|
Duration: 8 Sep 2015 → 11 Sep 2015
|Conference||IEEE International Conference on Cluster Computing, CLUSTER 2015|
|Period||8/09/15 → 11/09/15|