An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

References

• Carlisle , M. C. and Loyd , E. L. 1991 . On the k-coloring of intervals , ICCI'91 Vol. 497 , 90 – 101 . LNCS .
   Google Scholar
• Chang , G. J. , Farber , M. and Tuza , Z. 1993 . Algorithmic aspects of neighbourhood numbers . SIAM J. Discrete Math. , 6 : 24 – 29 .
   Web of Science ®Google Scholar
• Fabri , J. 1982 . Automatic Storage Optimization , Ann Arbor , MI : UMI Press .
   Google Scholar
• Golumbic , M. C. 1980 . Algorithmic graph theory and perfect graphs , New York : Academic Press .
   Google Scholar
• Hasbimoto , A. and Stevens , J. Wire routing by optimizing channel assignment within large apertures . Proc., 8th IEEE Design Automation Workshop . pp. 155 – 169 .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Jungck , J. R. , Dick , O. and Dick , A. G. 1982 . Computer assisted sequencing . interval graphs and molecular evolution, Biosystem , 15 : 259 – 273 .
   Google Scholar
• Lehel , J. and Tuza , Z. 1986 . Neighbourhood perfect graphs . Discrete Math. , 61 : 93 – 101 .
   Web of Science ®Google Scholar
• Ohtsuki , T. , Mori , H. , Khu , E. S. , Kashiwabara , T. and Fujisawa , T. 1979 . One dimensional logic gate assignment and interval graph . IEEE Trans. Circuits and Systems , 26 : 675 – 684 .
   Google Scholar
• Pal , M. and Bhattacharjee , G. P. 1997 . A data structure on interval graphs and its applications . J. Circuits, Systems, and Computers , 7 (3} ) : 165 – 175 .
   Web of Science ®Google Scholar
• Pal , M. and Bhattacharjee , G. P. 1997 . An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs . Nordic J. Computing , 4 : 342 – 356 .
   Google Scholar
• Pal , M. and Bhattacharjee , G. P. 1995 . Optimal sequential and parallel algorithms for computing the diameter and centre of an interval graph . Intern. J. Computer Math. , 59 : 1 – 13 .
   Web of Science ®Google Scholar
• Pal , M. and Bhattacharjee , G. P. 1995 . The parallel algorithms for determining edgepacking and efficient edge dominating sets in interval graphs . Parallel Algorithms and Applications , 7 : 193 – 207 .
   Google Scholar