Finding Articulation Points and Bridges of Permutation Graphs
Óscar H. Ibarra, Qi Zheng · 1993
We show that articulation points and bridges of permutation graphs can be found in O(logn) time using O(n/logn) processors on an EREW PRAM. The algorithms are optimal with respect to the time-processor product.