Proceedings Article10.1063/1.4897834
A GPU algorithm for minimum vertex cover problems
Kouta Toume,Daiki Kinjo,Morikazu Nakamura +2 more
- 06 Oct 2014
- Vol. 1618, Iss: 1, pp 724-727
6
TL;DR: This work proposes a GPU algorithm for the minimum vertex cover problem and demonstrates that the algorithm is quite faster than CPU programs and the speedup becomes much evident when the graph size is enlarged.
read more
Abstract: The minimum vertex cover problem is one of the fundamental problems in graph theory and is known to be NP-hard. For data mining in large-scale structured systems, we proposes a GPU algorithm for the minimum vertex cover problem. The algorithm is designed to derive sufficient parallelism of the problem for the GPU architecture and also to arrange data on the device memory for efficient coalesced accessing. Through the experimental evaluation, we demonstrate that our GPU algorithm is quite faster than CPU programs and the speedup becomes much evident when the graph size is enlarged.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Accelerating vertex cover optimization on a GPU architecture
Faisal N. Abu-Khzam,Do-Kyung Kim,Matthew Perry,Kai Wang,Peter Shaw +4 more
- 01 May 2018
TL;DR: This paper presents a highly scalable approach for the NP-hard Vertex Cover problem based on an advanced data structure to reduce memory usage for more parallelism and a load balancing scheme that is effective for multiGPU architectures.
8
Parallel Vertex Cover Algorithms on GPUs
01 May 2022
TL;DR: In this paper , the vertex cover search tree is traversed in parallel using GPUs while handling dynamic load balancing, where each thread block traverses a different sub-tree using a local stack, however, a global worklist is used to balance the load to ensure that all blocks remain busy.
Parallel Vertex Cover Algorithms on GPUs
Peter Yamout,Karim Barada,Adnan Jaljuli,Amer E. Mouawad,Izzat El Hajj +4 more
- 21 Apr 2022
TL;DR: The evaluation shows that compared to approaches used in prior work, the hybrid approach of using local stacks and a global worklist substantially improves performance and reduces load imbalance, especially on difficult instances of the vertex cover problem.
2
An Efficient Reduced-Memory GPU-based Dynamic Programming Strategy for Bounded Knapsack Problems
Girish Biswas,Nandini Mukherjee +1 more
- 25 Nov 2022
TL;DR: In this article , an implementation of an efficient dynamic programming technique to solve BKP on GPU-based system via CUDA is presented, which shows brilliant speedup over sequential implementation of the dynamic technique.
2
An Efficient Reduced-Memory GPU-based Dynamic Programming Strategy for Bounded Knapsack Problems
25 Nov 2022
TL;DR: In this article , an implementation of an efficient dynamic programming technique to solve BKP on GPU-based system via CUDA is presented, which shows brilliant speedup over sequential implementation of the dynamic technique.
1