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 ...

In their essence, recursive search tree algorithms are nothing but mere enumeration of the solution space. Most of the time is spent generating new search tree nodes with very little computation performed at each tree node. ...