On the proper intervalization of colored caterpillar trees
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/12953
Tipus de documentReport de recerca
Data publicació2009-11-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the picg and a graph layout problem the Proper colored layout problem (pclp). We show a dichotomy: the picg and the pclp are NP-complete for colored caterpillars of hair length ≥ 2, while both problems are in P for colored caterpillars of hair length < 2. For the hardness results we provide a reduction from the Multiprocessor Scheduling problem, while the polynomial time results follow from a characterization in terms of forbidden subgraphs.
Forma partAEOLUS-TR-Y4-4
URL repositori externhttp://aeolus.ceid.upatras.gr/scientific-reports/4th-year/
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Álvarez.pdf | 195,0Kb | Visualitza/Obre |