Rights accessRestricted access - publisher's policy
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
CitationÁlvarez, M.; Serna, M. On the proper intervalization of colored caterpillar trees. "RAIRO. Theoretical informatics and applications", 2009, vol. 43, núm. 4, p. 667-686.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org