Journal of applied mathematics & informatics

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

THE OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE ALL HINGE VERTICES ON INTERVAL GRAPHS

  • Published : 2001.05.01

⟨ Previous Next ⟩

Abstract

If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

Keywords

References

  1. Communited An Efficient algorithm for finding all hinge vertices on Trapezoid graphs D.Bera;M.Pal;T.K.Pal
  2. ICCI'91 v.497 On the k-coloring of intervals, LNCS M.C.Carlisle;E.L.Loyd
  3. Information Sciences v.99 Finding the set of all hinge vertices for strongly chordal graphs in linear time J.M.Chang;C.C.Hsu;Y.I.Wan;T.Y.Ho
  4. Automatic Storage Optimization J.Fabri
  5. Parallel Processing Letters v.3 A Self repairing networks A.M.Farley;A.Proskurowski
  6. Algorithmic graph theory and perfect graphs M.C.Golumbic
  7. Proc., 8th IEEE Design Automation Workshop Wire routing by optimizing channel assignment within large apertures A.Hashimoto;J.Stevens
  8. Information Processing Letters v.59 A linear time algorithm for finding all hinge vertices of a permutation graph T.Y.Ho.Y.L.Wang;M.T.Juan
  9. Biosystem v.15 Computer assisted sequencing, interval graphs and molecular evolution J.R.Jungck;O.Dick;A.G.Dick
  10. IEEE Trans.Circuits and Systems v.26 One dimensional logic gate assignment and internal graph T.Ohtsuki;H.Mori;E.S.Khu;T.Kashiwabara;T.Fujisawa
  11. Ph.D Thesis, Indian Institute of Technology Some sequential and parallel algorithms on interval graphs M.Pal