IWPEC   2010 International Workshop on Parameterized and Exact Computation
Wall of Fame | Most Viewed IWPEC-2010 Paper
13 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
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 c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source270
2Download preprint from source259
3Download preprint from source253
4Download preprint from source252
5Download preprint from source247
6Download preprint from source210
7Download preprint from source209