论文信息 - An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs

An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs

In this paper, a set of intervals is constructed by projecting geometrical representation of permutation graph to find all cutvertices and blocks of a permutation graph. The sequential and parallel algorithms are designed to find all cutvertices and blocks of permutation graphs. The sequential algorithms takes O(n) time and parallel algorithm takes O(log n) time using O(n/log n) processors on an EREW PRAM, where n represents the number of vertices of the graph.

Madhumangal Pal | Debashis Bera | Tapan Kumar Pal

[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[2] Frank Harary,et al. Graph Theory , 2016 .

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

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

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

[6] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[7] Madhumangal Pal,et al. An optimal parallel algorithm for computing cut vertices and blocks on interval graphs , 2000, Int. J. Comput. Math..

[8] C. Pandu Rangan,et al. Parallel Algorithms on Interval Graphs , 1995, RAIRO Theor. Informatics Appl..

[9] Madhumangal Pal. Efficient algorithms to compute all articulation points of a permutation graph , 1998 .

[10] Bela Bollobas,et al. Graph theory , 1979 .

[11] Y. Daniel Liang,et al. Finding Biconnected Components in O(n) Time for a Class of Graphs , 1996, Inf. Process. Lett..