References
- Communited An Efficient algorithm for finding all hinge vertices on Trapezoid graphs D.Bera;M.Pal;T.K.Pal
- ICCI'91 v.497 On the k-coloring of intervals, LNCS M.C.Carlisle;E.L.Loyd
- 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
- Automatic Storage Optimization J.Fabri
- Parallel Processing Letters v.3 A Self repairing networks A.M.Farley;A.Proskurowski
- Algorithmic graph theory and perfect graphs M.C.Golumbic
- Proc., 8th IEEE Design Automation Workshop Wire routing by optimizing channel assignment within large apertures A.Hashimoto;J.Stevens
- 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
- Biosystem v.15 Computer assisted sequencing, interval graphs and molecular evolution J.R.Jungck;O.Dick;A.G.Dick
- 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
- Ph.D Thesis, Indian Institute of Technology Some sequential and parallel algorithms on interval graphs M.Pal