A High-Performance MST Implementation for GPUs-Reference-Cited by-同舟云学术

A High-Performance MST Implementation for GPUs

Published:2023-11-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
language:
Short-container-title:

Author:

Fallin Alex¹^ORCID,Gonzalez Andres¹^ORCID,Seo Jarim¹^ORCID,Burtscher Martin¹^ORCID

Affiliation:

1. Dept. of Computer Science, Texas State University, San Marcos, Texas, United States of America

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3581784.3607093

Reference34 articles.

1. Prim-Dijkstra tradeoffs for improved performance-driven routing tree design

2. Internally deterministic parallel algorithms can be fast

3. Minimal spanning trees and partial sorting

4. Mariel Brinkhuis , Gerrit A Meijer , Paul J Van Diest , Leonard T Schuurmans, and JP Baak. 1997 . Minimum spanning tree analysis in advanced ovarian carcinoma. An investigation of sampling methods, reproducibility and correlation with histologic grade. Analytical and quantitative cytology and histology 19, 3 (1997), 194--201. Mariel Brinkhuis, Gerrit A Meijer, Paul J Van Diest, Leonard T Schuurmans, and JP Baak. 1997. Minimum spanning tree analysis in advanced ovarian carcinoma. An investigation of sampling methods, reproducibility and correlation with histologic grade. Analytical and quantitative cytology and histology 19, 3 (1997), 194--201.

5. Martin Burtscher and Alex Fallin. 2023. ECL-MST Git Repository. https://github.com/burtscher/ECL-MST. Accessed: 2023-08-18. Martin Burtscher and Alex Fallin. 2023. ECL-MST Git Repository. https://github.com/burtscher/ECL-MST. Accessed: 2023-08-18.