Graphics Processing Units (GPUs) are gaining notable popularity due to their affordable
high performance multi-core architecture. They are particularly useful for massive
computations that involve large data sets. In this paper, we present a highly scalable
approach for the NP-hard Vertex Cover problem. Our method is based on an advanced data
structure to reduce memory usage for more parallelism and we propose a load balancing
scheme that is effective for multiGPU architectures. Our parallel algorithm was implemented …