论文信息 - Finding Articulation Points and Bridges of Permutation Graphs

Finding Articulation Points and Bridges of Permutation Graphs

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.

Oscar H. Ibarra | Qi Zheng

[1] Larry Rudolph,et al. The power of parallel prefix , 1985, IEEE Transactions on Computers.

[2] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[3] Jeremy P. Spinrad,et al. Incremental modular decomposition , 1989, JACM.

[4] Yung H. Tsin,et al. Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[5] Charles J. Colbourn,et al. Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..

[6] K. Arvind,et al. Connected Domination and Steiner Set on Weighted Permutation Graphs , 1992, Inf. Process. Lett..

[7] Alan P. Sprague,et al. Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs , 1992, Inf. Process. Lett..