References
- Carlisle , M. C. and Loyd , E. L. On the k-coloring of Intervals . Proceedings of the International Conference on Computing and Information-ICCI’91 (Lecture Notes in Comput. Sci.) . Vol. 497 , pp. 90 – 101 . Springer Verlag .
- Chang , G. J. , Farber , M. and Tuza , Z. 1993 . Algorithmic aspects of neighbourhood numbers . SIAM J. Discrete Math. , 6 : 24 – 29 .
- Fabri , J. 1982 . Automatic Storage Optimization , Ann Arbor, MI : UMI Press .
- Ghosh , P. K. and Pal , M. 2007 . An optimal algorithm to solve 2-neighbourhood-covering problem on trapezoid graphs . Adv. Model. Optim. , 9 ( 1 ) : 15 – 36 .
- Golumbic , M. C. 1980 . “ Algorithmic Graph Theory and Perfect Graphs ” . New York : Academic Press .
- Hashimoto , A. and Stevens , J. Wire Routing by Optimizing Channel Assignment within Large Apertures . Proceedings of the 8th IEEE Design Automation Workshop . pp. 155 – 169 .
- Hwang , S. F. and Chang , G. J. 1998 . k-neighbourhood-covering and independence problems for chordal graphs . SIAM J. Discrete Math. , 11 ( 4 ) : 633 – 643 .
- Jungck , J. R. , Dick , O. and Dick , A. G. 1982 . Computer assisted sequencing, interval graphs and molecular evolution . Biosystem , 15 : 259 – 273 .
- Lehel , J. and Tuza , Z. 1986 . Neighbourhood perfect graphs . Discrete Math. , 61 : 93 – 101 .
- Mondal , S. , Pal , M. and Pal , T. K. 2002 . An optimal algorithm to solve 2-neighbourhood-covering problem on interval graphs . Int. J. Comput. Math. , 79 : 189 – 204 .
- Ohtsuki , T. , Mori , H. , Khu , E. S. , Kashiwabara , T. and Fujisawa , T. 1979 . One dimensional logic gate assignment and interval graph . IEEE Trans. Circuits Syst. , 26 : 675 – 684 .
- M. Pal, Some sequential and parallel algorithms on interval graphs, Ph.D. Thesis, Indian Institute of Technology, Kharagpur, West Bengal, India, 1995
- Pal , M. and Bhattacharjee , G. P. 1995 . Optimal sequential and parallel algorithms for computing the diameter and centre of an interval graph . Int. J. Comput. Math. , 59 : 1 – 13 .
- Pal , M. and Bhattacharjee , G. P. 1997 . A data structure on interval graphs and its applications . J. Circuits, Syst. Comput. , 7 ( 3 ) : 165 – 175 .
- Pal , M. and Bhattacharjee , G. P. 1997 . An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs . Nord. J. Comput. , 4 : 342 – 356 .