☆
Multi-core spanning forest algorithms using the disjoint-set data structure
https://www.researchgate.net/publication/261355883_Multi-core_Spanning_Forest_Algorithms_using_the_Disjoint-set_Data_Structure
Authors: Md. Mostofa Ali Patwary, Peder Refsnes, Fredrik Manne
Liked by: Maximimi
Domains: Graph algorithms
Tags: Union Find
Uploaded by: IoannisPan
Upload date: 2021-03-02 16:57:43
Edited at: 2021-03-08 11:17:07
Edited by: Maximimi

Comments:

Nice paper! Very clear and useful!! I do not see absolute time values in the experiments, just speedups. It would have been nice to show some absolute values too. I've implemented the algorithms [here](https://github.com/maxdan94/ParallelUnionFind). On a very large graphs with more than 10 billions of edges (the twitter graph [here](https://sites.google.com/view/limass/datasets)), I observe that the verification algorithm is faster and leads to better speedups than the lock algorithm.
Reply
Maximimi at 2021-03-08 11:24:06
Edited by Maximimi at 2021-03-11 19:45:06

Please consider to register or login to comment on the paper.