Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
The problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for kgeq 4 and has polynomial time algorithms for k=2 and k=3....
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96513 |
| Acceso en línea: | https://hdl.handle.net/2117/96513 |
| Access Level: | acceso abierto |
| Palabra clave: | Colored graphs intervalizing Caterpillars Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | The problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for kgeq 4 and has polynomial time algorithms for k=2 and k=3. In this paper we prove that the problem is NP-Complete for caterpillars with hairs of length at most 2. In the positive side we give polynomial time algorithms for the problem in the cases, caterpillars with hairs of length at most 1 and any number of colors and caterpillars with hairs of length at most 2 and a constant number of colors. It is the first time a problem has been shown NP-complete for the particular case of caterpillars of hairs of length at most 2. |
|---|