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/log^{1-\epsilon}(n)})\) time for all Īµ>ā0. We also give an O *(2n) algorithm for the case that the number of colors k is not fixed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ćlvarex, C., DĆaz, J., Serna, M.: The hardness of intervalizing four colored caterpillars. Discrete MathematicsĀ 235, 19ā27 (2001)
Ćlvarex, C., Serna, M.: On the proper intervalization of colored caterpillar trees. Informatique ThĆ©orique et ApplicationsĀ 43, 667ā686 (2010)
Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of AlgorithmsĀ 11, 631ā643 (1990)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on ComputingĀ 25, 1305ā1317 (1996)
Bodlaender, H.L., de Fluiter, B.: Intervalizing k-colored graphs. In: FĆ¼lƶp, Z., GĆ©cseg, F. (eds.) ICALP 1995. LNCS, vol.Ā 944, pp. 87ā98. Springer, Heidelberg (1995)
Bodlaender, H.L., de Fluiter, B.: On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied MathematicsĀ 71, 55ā77 (1996)
Bodlaender, H.L., de Fluiter, B.L.E.: Intervalizing k-colored graphs. Technical Report UU-CS-1995-15, Department of Computer Science, Utrecht University, Utrecht, the Netherlands (1995)
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.Ā 4168, pp. 672ā683. Springer, Heidelberg (2006)
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. Technical Report UU-CS-2006-032, Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands (2006)
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Technical Report UU-CS-2009-023, Department of Information and Computer Sciences, Utrecht University, Utrecht, the Netherlands (2009)
Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of AlgorithmsĀ 21, 358ā402 (1996)
Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer JournalĀ 51, 292ā302 (2008)
Fellows, M.R., Hallett, M.T., Wareham, H.T.: DNA physical mapping: Three ways difficult (extended abstract). In: Lengauer, T. (ed.) ESA 1993. LNCS, vol.Ā 726, pp. 157ā168. Springer, Heidelberg (1993)
Fomin, F.V., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.Ā 2996, pp. 56ā67. Springer, Heidelberg (2004)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Golumbic, M.C., Kaplan, H., Shamir, R.: On the complexity of DNA physical mapping. Advances in Applied MathematicsĀ 15, 251ā261 (1994)
Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of AlgorithmsĀ 19, 449ā472 (1995)
Heggernes, P., Suchan, K., Todinca, I., Villanger, Y.: Minimal interval completions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.Ā 3669, pp. 403ā414. Springer, Heidelberg (2005)
Held, M., Karp, R.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied MathematicsĀ 10, 196ā210 (1962)
Kaplan, H., Shamir, R.: Bounded degree interval sandwich problems. AlgorithmicaĀ 24, 96ā104 (1999)
Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM Journal on ComputingĀ 9, 615ā627 (1980)
McMorris, F.R., Warnow, T., Wimer, T.: Triangulating vertex-colored graphs. SIAM Journal on Discrete MathematicsĀ 7(2), 296ā306 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., van Rooij, J.M.M. (2011). Exact Algorithms for Intervalizing Colored Graphs. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)