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

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method
Authors
Keywords
Euclidean minimum spanning tree, EMST, GPU parallel EMST, Breadth first search, GPU parallel BFS, Decentralized control, Data parallel
Journal
APPLIED SOFT COMPUTING
Volume 76, Issue -, Pages 105-120
Publisher
Elsevier BV
Online
2018-12-13
DOI
10.1016/j.asoc.2018.10.046

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.