Mostra el registre d'ítem simple
The Proper interval colored graph problem for caterpillar trees
dc.contributor.author | Álvarez Faura, M. del Carme |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-07T12:31:11Z |
dc.date.available | 2016-11-07T12:31:11Z |
dc.date.issued | 1999-04 |
dc.identifier.citation | Alvarez, C., Serna, M. "The Proper interval colored graph problem for caterpillar trees". 1999. |
dc.identifier.uri | http://hdl.handle.net/2117/93011 |
dc.description.abstract | 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. |
dc.format.extent | 19 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-99-12-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | PICG |
dc.subject.other | PCLP |
dc.subject.other | Proper interval colored graph problem |
dc.subject.other | Proper colored layout problem |
dc.subject.other | Computational complexity |
dc.title | The Proper interval colored graph problem for caterpillar trees |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1838056 |
dc.description.version | Postprint (published version) |
local.citation.author | Alvarez, C.; Serna, M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]