Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach

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.