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

References

• Bollobas , B. 1979 . Graph Theory , New York : Spring .
   Google Scholar
• Das , S. K. and Chen , C. C. Y. 1992 . Proc, 1992 International Conf. on Parallel Processing . Efficient parallel algorithm for computing articulation points and bridges of interval graphs . 1992 . pp. III-164 – III-167 .
   Google Scholar
• Deo , N. 1990 . Graph theory with applications to engineering and computer science , New Delhi : Prentice Hall of India Pt. Ltd. .
   Google Scholar
• Golumbic , M. C. 1980 . Algorithmic graph theory and perfect graphs , New York : Academic Press .
   Google Scholar
• Harary , F. 1969 . Graph theory , Reading, M.A : Addison-Wesley .
   Google Scholar
• Ramkumar , G. D. S. and Pandu Rangan , C. 1990 . Proc: 1990 International Conf. on Parallel Processing . Parallel algorithms on interval graphs . 1990 . pp. 72 – 74 .
   Google Scholar
• Sprague , A. P. and Kulkarni , K. H. 1992 . Optimal parallel algorithms for finding cut vertices and bridges of interval graphs . Information Processing Letters , 42 229 – 234 .
   Web of Science ®Google Scholar
• Tarjan , R. E. and Vishkin , U. 1985 . An efficient parallel biconnectivity algorithm . SIAM J. Comput. , 14 862 – 874 .
   Web of Science ®Google Scholar
• Tsin , Y. H. and Chain , F. Y. 1984 . Efficient parallel algorithms for a class of graph theoretic problems . SIAM J. Comput. , 13 580 – 599 .
   Google Scholar
• Liang , Y. D. and Rhee , C. 1996 . Finding biconnected components in O(n) time for a class of graphs . Information Processing Letters , 60 159 – 163 .
   Google Scholar
• Pal , M. 1998 . Efficient algorithms to compute all articulation points of a permutation graph . Korean J. of Computational and Applied Mathematics , 5 ( 1 ) 141 – 152 .
   Google Scholar
• Pal M. Bera D. Mondai S. Pal T. K. An optimal parallel algorithm for computing cut vertices and blocks on interval graphs, communicated
   Google Scholar