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 条
  • [1] A MapReduce algorithm for minimum vertex cover problems and its randomization
    Nakamura M.
    Kinjo D.
    Yoshida T.
    Computing and Informatics, 2021, 39 (05) : 952 - 972
  • [2] A MAPREDUCE ALGORITHM FOR MINIMUM VERTEX COVER PROBLEMS AND ITS RANDOMIZATION
    Nakamura, Morikazu
    Kinjo, Daiki
    Yoshida, Takeo
    COMPUTING AND INFORMATICS, 2020, 39 (05) : 952 - 972
  • [3] An Approximation Algorithm for the Minimum Vertex Cover Problem
    Chen, Jingrong
    Kou, Lei
    Cui, Xiaochuan
    GREEN INTELLIGENT TRANSPORTATION SYSTEM AND SAFETY, 2016, 138 : 180 - 185
  • [4] An Exact Algorithm for Minimum Vertex Cover Problem
    Wang, Luzhi
    Hu, Shuli
    Li, Mingyang
    Zhou, Junping
    MATHEMATICS, 2019, 7 (07)
  • [5] An Approximation Algorithm for Minimum Vertex Cover on General Graphs
    Li, Shaohua
    Wang, Jianxin
    Chen, Jianer
    Wang, Zhijian
    THIRD INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY WORKSHOPS (ISECS 2010), 2010, : 249 - 252
  • [6] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    International Journal of Computational and Mathematical Sciences, 2010, 4 (01): : 34 - 38
  • [7] A Massively Parallel Algorithm for Minimum Weight Vertex Cover
    Ghaffari, Mohsen
    Jin, Ce
    Nilis, Daan
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 259 - 268
  • [8] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 43 : 315 - 319
  • [9] New Heuristic Algorithm for Unweighted Minimum Vertex Cover
    Ugurlu, Onur
    2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI), 2012,
  • [10] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 67 : 315 - 319
12345