The problem of Intervalizing Colored Graphs (ICG) 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 k>3 and has polynomial time
algorithms for k=2 and k=3.
In this paper we show that the ICG problem is NP-complete when the graph
is a caterpillar tree, colored with k=4 (or more) colors, strengthen
the cases for which the problem remains difficult.
CitationSerna Iglesias, María José; Díaz Iriberri, José; Álvarez Faura, M. del Carme. "The Hardness of intervalizing four colored caterpillars". 1998.
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: email@example.com