IWPEC 2010 International Workshop on Parameterized and Exact Computation
 |  |
Wall of Fame | Most Viewed IWPEC-2010 Paper
IWPEC
2010
Springer
13 years 9 months ago
2010
Springer
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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 270 | ||
| 2 | | 259 | ||
| 3 | | 253 | ||
| 4 | | 252 | ||
| 5 | | 247 | ||
| 6 | | 210 | ||
| 7 | | 209 |