12 citations · 25 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DC2020★ 12 cited
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Changwan Hong, Laxman Dhulipala, Julian Shun
Connected components and spanning forest are fundamental graph algorithms due to their use in many important applications, such as graph clustering and image segmentation. GPUs are…
cs.DC2020★ 8 cited
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Laxman Dhulipala, Changwan Hong, Julian Shun
Connected components is a fundamental kernel in graph applications. The fastest existing parallel multicore algorithms for connectivity are based on some form of edge sampling and/…