Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units

IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology Pub Date : 2014-06-05 DOI:10.1109/EIT.2014.6871746

C. Trefftz, Andrés Santamaría-Galvis, Roberto Cruz

引用次数: 3

Abstract

An algorithm to find the maximal clique on an interval graphs was parallelized on Graphical Processing Units. The algorithm was implemented using CUDA and the Thrust library. Performance results are reported.

查看原文本刊更多论文

在图形处理单元上并行化一种求区间图上最大团的算法

在图形处理单元上并行化了一种求区间图上最大团的算法。该算法使用CUDA和Thrust库实现。报告性能结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology

自引率

0.00%

发文量