Finding a hamilton path through a family of intervals

References

• Aboelfotoh , A. and Colbourn , C. 1990 . Efficient algorithms for computing the reliability of permutation and interval graphs . Networks , 20 : 883 – 898 .
   Google Scholar
• Arikati , S. R. and Pandu Rangan , C. 1990 . Linear algorithm for optimal path cover problem on interval graphs . Information Processing Letters , 35 : 149 – 153 .
   Google Scholar
• Bertossi , A. and Bonnucelli . 1986 . Hamiltonian circuits in interval graph generalizations . Inf. Proc. Lett , 23 : 195 – 200 .
   Google Scholar
• Gilmore , P. C. and Hoffman , A. J. 1964 . A characterization of comparability graphs and of interval graphs . Canad. J. Math. , 16 : 539 – 548 .
   Web of Science ®Google Scholar
• Golumbic , M. C. 1980 . Algorithmic graph theory and perfect graphs , New york : Academic Press .
   Google Scholar
• Hall , P. 1935 . On representations of subsets . J, London Math. Soc. , 10 : 26 – 30 .
   Google Scholar
• Keil , J. M. 1985 . Finding hamiltonian circuits in interval graphs . Inf. Proc. Lett. , 20 : 201 – 206 .
   Google Scholar
• Klein , P. N. 1988 . Efficient parallel algorithms for chordal graphs . Proc. Foundations of Computer Science , 20 : 150 – 161 .
   Google Scholar
• Manacher , G. A. , Mankus , T. A. and Smith , C. J. 1990 . An optimal (n log n) algorithm for finding a canonical hamiltonian path and a canoncial circuit in a set of intervels . Information Processing Letters , 35 : 205 – 211 .
   Google Scholar
• Moitra , A. and Johnson , R. 1988 . PT-optimal algorithms for interval graph . Proc. Allerton Conf. on Communication, Control and Computing , 35
   Google Scholar
• Moitra , A. and Johnson , R. 1989 . A parallel algorithm for maximum matching on interval graphs . Proc.Int. Conf. , 35 : 114 – 120 .
   Google Scholar
• Sridhar , M. A. and Goyal , S. 1991 . Efficient parallel computation of hamilton paths and circuits in interval graphs . Proc. Int. Conf. , 35 : 83 – 90 .
   Google Scholar
• Tarjan , R. E. 1983 . Data structures and network algorithms , CBMS-NSF series in Applied Mathematics .
   Google Scholar