Sciweavers

21 search results - page 5 / 5
» stoc 1995
Sort
View
IWPEC
2010
Springer
13 years 3 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...