26 citations · 50 across the 5 of their papers we have counts for
1 paper · 1 filter
Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié
Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing…