Cited By
View all- Wang LDong XGu YSun Y(2023)Parallel Strong Connectivity Based on Faster ReachabilityProceedings of the ACM on Management of Data10.1145/35892591:2(1-29)Online publication date: 20-Jun-2023
- Niewenhuis DVarbanescu ASterpone LBartolini AButko A(2022)Efficient trimming for strongly connected components calculationProceedings of the 19th ACM International Conference on Computing Frontiers10.1145/3528416.3530247(131-140)Online publication date: 17-May-2022
- Dhulipala LBlelloch GShun JScheideler CFineman J(2018)Theoretically Efficient Parallel Graph Algorithms Can Be Fast and ScalableProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210414(393-404)Online publication date: 11-Jul-2018
- Show More Cited By