6 citations · 6 across the 1 of their papers we have counts for
1 paper · 1 filter
Xiaojun Dong, Letong Wang, Yan Gu +1
Biconnectivity is one of the most fundamental graph problems. The canonical parallel biconnectivity algorithm is the Tarjan-Vishkin algorithm, which has O(n+m) optimal work (numb…