Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH

  • Published : 1998.03.01

⟨ Previous Next ⟩

Abstract

Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

Keywords

References

  1. Graph Theory B.Bollobas
  2. SIAM J. Comput v.17 Parallel merge sort R.Cole
  3. Information and Computing v.81 Faster optimal parallel prefix sums and list ranking R.Cole;U.Vishkin
  4. Proc: 1992 International Conf. on Parallel Processing v.3 Efficient parallel algorithms for computing articulation points and bridges of interval graphs S.K.Das;C.C.-Y.Chen
  5. Graph Theory with Applications Engineering and Computer Science N.Deo
  6. Algorithmec Graph Theory and Perfect Graphs M.C.Golumbic
  7. Graph Theory F.Harary
  8. Proc: 1990 international Conf. on Parallel Processing v.3 Parallel algorithms on interval graphs G.D.S.Ramkumar;C.Pandu Rangan
  9. An optimal parallel algorithm for computing cut vertices and blocks on interval graphs M.Pal;D.Bera;S.Mondal;T.K.Pal
  10. Information Processing Letters v.42 Optimal parallel algorithms for finding cut vertices and bridges of interval graphs A.P.Sprague;K.H.Kulkarni
  11. SIAM J. Comput v.14 An efficient parallel biconnectivity algorithm R.E.Tarjan;U.Vishkin
  12. SIAM J. Comput v.13 Efficient parallel algorithms for a class of graph theoretic problems Y.H.Tsin;F.Y.Chain