The hardness of intervalizing four colored caterpillars

Discrete Mathematics

Volumn 235, Issue 1-3, 2001, Pages 19-27

  Alvarez C ^a   Diaz J ^a   Serna, M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035962751     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00257-0     Document Type: Article

References (10)

1. C. À Ivarez, J. Díaz, M. Serna, Intervarlizing colored graphs is NP-complete for caterpillars with hair length 2, Technical Report LSI 98-9-R, Universitat Politècnica de Catalunya, 1998.
2. H. Bodlaender, B. de Fluiter, Intervalizing k-colored graphs, in: Z. Fulop, F. Gecseg (Eds.), International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science, Vol. 944, Springer, Berlin, 1995, pp. 87-98.
3. H. Bodlaender, M.R. Fellows, M.T. Hallet, Beyond NP-completeness for problems of bounded width: hardness for the W-hierarchy, ACM Symposium on Theory of Computing, 1995, pp. 449-458.
4. M.J. Dinneen, VLSI Layouts and DNA physical mappings, Technical Report, Los Alamos National Laboratory, 1996.
5. M.R. Fellows, M.T. Halett, T. Wareham, DNA physical mapping: Three ways difficult, in: T. Lengauer (Ed.), First European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 726, Springer, Berlin, 1993, pp. 157-168.
6. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
7. M.C. Golumbic, H. Kaplan, R. Shamir, On the complexity of DNA physical mapping, Adv. Appl. Math. 15 (1994) 203-215.
8. M.C. Golumbic, R. Shamir, Complexity and algorithms for reasoning about time: a graph theoretical approach, J. ACM 40 (1993) 1108-1113.
9. H. Kaplan, R. Shamir, Physical maps and interval sandwich problems: bounded degrees helps, Technical Report, Shackler Faculty of Exact Sciences, Tel Aviv, 1996.
10. J.C. Setubal, J. Meidanis, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, 1997.