Abstract
In the Intervalizing Colored Graphs problem, one must decide for a given graph G = (V,E) with a proper vertex coloring of G whether G is the subgraph of a properly colored interval graph. For the case that the number of colors k is fixed, we give an exact algorithm that uses O* (2 n/log1-ε(n)) time for all ε > 0. We also give an O*(2n) algorithm for the case that the number of colors k is not fixed. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Bodlaender, H. L., & Van Rooij, J. M. M. (2011). Exact algorithms for intervalizing colored graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6595 LNCS, pp. 45–56). https://doi.org/10.1007/978-3-642-19754-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
