On the kernelization complexity of colorful motifs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6478 LNCS, Issue , 2010, Pages 14-25

  Ambalath, Abhimanyu M ^a   Balasundaram, Radheshyam ^b   Rao H , Chintan ^c   Koppula, Venkata ^d   Misra, Neeldhara ^e   Philip, Geevarghese ^e   Ramanujan, M S ^e  

^a NATIONAL INSTITUTE OF TECHNOLOGY CALICUT   (India)

^b BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE   (India)

^c INDIAN INSTITUTE OF SCIENCE   (India)

^d INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^e INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CODING TECHNIQUES; COMPUTATIONAL BIOLOGY; CONNECTED DOMINATING SET; GENERAL CLASS; GENERAL GRAPH; GRAPH CLASS; GRAPH G; KERNELIZATION; MAXIMUM DEGREE; NP COMPLETE; POLYNOMIAL KERNELS; THEORETICAL POINTS;

BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS;

POLYNOMIALS;

EID: 78650858414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17493-3_4     Document Type: Conference Paper

References (16)

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), http://www.imsc.res.in/~gphilip/publications/cm.pdf [Full Version]
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)
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)
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)
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)
6. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Kernelization hardness of connectivity problems in d-degenerate graphs. Accepted at WG 2010 (2010)
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)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
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)
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)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
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)
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)
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)
15. Lokshtanov, D.: New Methods in Parameterized Algorithms and Complexity. PhD thesis, University of Bergen, Norway (2009)
16. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)