A GPU Algorithm for Minimum Vertex Cover Problems

被引：3

作者：

Toume, Kouta ^{[1
]}

Kinjo, Daiki ^{[1
]}

Nakamura, Morikazu ^{[1
]}

机构：

[1] Univ Ryukyus, Dept Informat Engn, Okinawa 9030213, Japan

来源：

INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2014 (ICCMSE 2014) | 2014年 / 1618卷

关键词：

GPU; Minimum Vertex Cover; CUDA;

D O I：

10.1063/1.4897834

中图分类号：

O59 [应用物理学];

学科分类号：

摘要：

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.

引用

页码：724 / 727

页数：4

共 50 条

[31] Approximation algorithm for minimum connected 3-path vertex cover
Liu, Pengcheng
Zhang, Zhao
Li, Xianyue
Wu, Weili
DISCRETE APPLIED MATHEMATICS, 2020, 287 : 77 - 84
[32] An algorithm based on Hopfleld network learning for minimum vertex cover problem
Chen, XM
Tang, Z
Xu, XS
Li, SS
Xia, GP
Wang, JH
ADVANCES IN NEURAL NETWORKS - ISNN 2004, PT 1, 2004, 3173 : 430 - 435
[33] An ant colony optimization algorithm for the minimum weight vertex cover problem
Shyu, SJ
Yin, PY
Lin, MT
ANNALS OF OPERATIONS RESEARCH, 2004, 131 (1-4) : 283 - 304
[34] Accelerating Vertex Cover Optimization on a GPU Architecture
Abu-Khzam, Faisal N.
Kim, Do Kyung
Perry, Matthew
Wang, Kai
Shaw, Peter
2018 18TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2018, : 616 - 625
[35] An approximation of the minimum vertex cover in a graph
Hiroshi Nagamochi
Toshihide Ibaraki
Japan Journal of Industrial and Applied Mathematics, 1999, 16 : 369 - 375
[36] The Minimum Generalized Vertex Cover Problem
Hassin, Refael
Levin, Asaf
ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (01) : 66 - 78
[37] The minimum generalized vertex cover problem
Hassin, R
Levin, A
ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 289 - 300
[38] An approximation of the minimum vertex cover in a graph
Nagamochi, H
Ibaraki, T
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 1999, 16 (03) : 369 - 375
[39] Minimum vertex cover in rectangle graphs
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2011, 44 (6-7): : 356 - 364
[40] Optimization of unweighted minimum vertex cover
Balaji, S.
Swaminathan, V.
Kannan, K.
World Academy of Science, Engineering and Technology, 2010, 67 : 508 - 513

← 1 2 3 4 5 →