GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method

标题
GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method
作者
关键词
Euclidean minimum spanning tree, EMST, GPU parallel EMST, Breadth first search, GPU parallel BFS, Decentralized control, Data parallel
出版物
APPLIED SOFT COMPUTING
Volume 76, Issue -, Pages 105-120
出版商
Elsevier BV
发表日期
2018-12-13
DOI
10.1016/j.asoc.2018.10.046

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now