Scalable parallel OPTICS data clustering using graph algorithmic techniques
OPTICS is a hierarchical density-based data clustering algorithm that discovers arbitrary-
shaped clusters and eliminates noise using adjustable reachability distance thresholds …
shaped clusters and eliminates noise using adjustable reachability distance thresholds …
[PDF][PDF] Design and implementation of GPU-based prim's algorithm
W Wang, Y Huang, S Guo - International Journal of Modern …, 2011 - mecs-press.org
Minimum spanning tree is a classical problem in graph theory that plays a key role in a
broad domain of applications. This paper proposes a minimum spanning tree algorithm …
broad domain of applications. This paper proposes a minimum spanning tree algorithm …
A High-Performance MST Implementation for GPUs
A Fallin, A Gonzalez, J Seo, M Burtscher - Proceedings of the …, 2023 - dl.acm.org
Finding a minimum spanning tree (MST) is a fundamental graph algorithm with applications
in many fields. This paper presents ECL-MST, a fast MST implementation designed …
in many fields. This paper presents ECL-MST, a fast MST implementation designed …
Hardware and software implementations of Prim's algorithm for efficient minimum spanning tree computation
Minimum spanning tree (MST) problems play an important role in many networking
applications, such as routing and network planning. In many cases, such as wireless ad-hoc …
applications, such as routing and network planning. In many cases, such as wireless ad-hoc …
A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal's and Prim's Algorithms
In last decade, application developers attained improved performances by merely
employing the machines based on higher-clocked processors. However, in 2003 multi-core …
employing the machines based on higher-clocked processors. However, in 2003 multi-core …
Parallelization of minimum spanning tree algorithms using distributed memory architectures
Finding a minimum spanning tree of a graph is a well known problem in graph theory with
many practical applications. We study serial variants of Prim's and Kruskal's algorithm and …
many practical applications. We study serial variants of Prim's and Kruskal's algorithm and …
GPU-based fast minimum spanning tree using data parallel primitives
W Wang, S Guo, F Yang, J Chen - 2010 2nd International …, 2010 - ieeexplore.ieee.org
Minimum spanning tree is a classical problem in graph theory that plays a key role in a
broad domain of applications. This paper proposes a minimum spanning tree algorithm …
broad domain of applications. This paper proposes a minimum spanning tree algorithm …
[PDF][PDF] Distributed memory parallel algorithms for minimum spanning trees
V Loncar, S Škrbic, A Balaz - Proceedings of the World Congress on …, 2013 - iaeng.org
Finding a minimum spanning tree of a graph is a well known problem in graph theory with
many practical applications. We study serial variants of Prim's and Kruskal's algorithm and …
many practical applications. We study serial variants of Prim's and Kruskal's algorithm and …
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components
EN Cáceres, H Mongelli, C Nishibe… - … Conference on High …, 2010 - ieeexplore.ieee.org
Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the
connected components of a graph, that requires O (log p) communication rounds, where p is …
connected components of a graph, that requires O (log p) communication rounds, where p is …
Parallel implementation of minimum spanning tree algorithms using MPI
V Lončar, S Škrbic - 2012 IEEE 13th International Symposium …, 2012 - ieeexplore.ieee.org
In this paper we study parallel algorithms for finding minimum spanning tree of a graph. We
present two algorithms, based on sequential algorithms of Prim and Kruskal, targeting …
present two algorithms, based on sequential algorithms of Prim and Kruskal, targeting …