On the Kernelization Complexity of Colorful Motifs

  • Abhimanyu M. Ambalath
  • Radheshyam Balasundaram
  • Chintan Rao H.
  • Venkata Koppula
  • Neeldhara Misra
  • Geevarghese Philip
  • M. S. Ramanujan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6478)


The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every color in the graph exactly once. The problem is motivated by applications in computational biology and is also well-studied from the theoretical point of view. In particular, it is known to be NP-complete even on trees of maximum degree three [Fellows et al, ICALP 2007]. In their pioneering paper that introduced the color-coding technique, Alon et al. [STOC 1995] show, inter alia, that the problem is FPT on general graphs. More recently, Cygan et al. [WG 2010] showed that Colorful Motif is NP-complete on comb graphs, a special subclass of the set of trees of maximum degree three. They also showed that the problem is not likely to admit polynomial kernels on forests.

We continue the study of the kernelization complexity of the Colorful Motif problem restricted to simple graph classes. Surprisingly, the infeasibility of polynomial kernelization persists even when the input is restricted to comb graphs. We demonstrate this by showing a simple but novel composition algorithm. Further, we show that the problem restricted to comb graphs admits polynomially many polynomial kernels. To our knowledge, there are very few examples of problems with many polynomial kernels known in the literature. We also show hardness of polynomial kernelization for certain variants of the problem on trees; this rules out a general class of approaches for showing many polynomial kernels for the problem restricted to trees. Finally, we show that the problem is unlikely to admit polynomial kernels on another simple graph class, namely the set of all graphs of diameter two. As an application of our results, we settle the classical complexity of Connected Dominating Set on graphs of diameter two — specifically, we show that it is NP-complete.


Polynomial Time Algorithm General Graph Parameterized Problem Polynomial Kernel Graph Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ambalath, A.M., Balasundaram, R., Chintan Rao, H., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the kernelization complexity of colorful motifs (2010), [Full Version]
  2. 2.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences 75(8), 423–434 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 635–646. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Bruckner, S., Hüffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 74–89. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Cai, J.-y., Chakaravarthy, V.T., Hemaspaandra, L.A., Ogihara, M.: Competing provers yield improved Karp-Lipton collapse results. Information and Computation 198(1), 1–23 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Kernelization hardness of connectivity problems in d-degenerate graphs. Accepted at WG 2010 (2010)Google Scholar
  7. 7.
    Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through Colors and IDs. In: Proceedings of ICALP 2009. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)CrossRefzbMATHGoogle Scholar
  9. 9.
    Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 340–351. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. In: Proceedings of STACS 2009, pp. 421–432 (2009)Google Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  12. 12.
    Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Proceedings of STOC 2008, pp. 133–142. ACM, New York (2008)Google Scholar
  13. 13.
    Guillemot, S., Sikora, F.: Finding and counting vertex-colored subtrees. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 405–416. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: Application to metabolic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(4), 360–368 (2006)CrossRefGoogle Scholar
  15. 15.
    Lokshtanov, D.: New Methods in Parameterized Algorithms and Complexity. PhD thesis, University of Bergen, Norway (2009)Google Scholar
  16. 16.
    Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Abhimanyu M. Ambalath
    • 1
  • Radheshyam Balasundaram
    • 2
  • Chintan Rao H.
    • 3
  • Venkata Koppula
    • 4
  • Neeldhara Misra
    • 5
  • Geevarghese Philip
    • 5
  • M. S. Ramanujan
    • 5
  1. 1.National Institute of TechnologyCalicutIndia
  2. 2.Birla Institute of Technology and SciencePilaniIndia
  3. 3.Indian Institute of ScienceBangaloreIndia
  4. 4.Indian Institute of TechnologyKanpurIndia
  5. 5.The Institute of Mathematical SciencesChennaiIndia

Personalised recommendations