The Proper interval colored graph problem for caterpillar trees
This paper studies the computational complexity of the Proper Interval Colored Graph problem (PICG), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove our result we make use of a close relationship between intervalizing problems and...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1999 |
| 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/93011 |
| Acceso en línea: | https://hdl.handle.net/2117/93011 |
| Access Level: | acceso abierto |
| Palabra clave: | PICG PCLP Proper interval colored graph problem Proper colored layout problem Computational complexity Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | This paper studies the computational complexity of the Proper Interval Colored Graph problem (PICG), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove our result we make use of a close relationship between intervalizing problems and graph layout problems. We define a graph layout problem the Proper Colored Layout Problem (PCLP). Although PCLP is not equivalent to PICG, by transforming the input graph we will stablish a close relationship between both problems. The main result is that the PICG is NP-complete for colored caterpillars of hair length 2 and in P for caterpillars of hair length 1 or 0. |
|---|