# Abhimanyu M. Ambalath

- Citations Per Year

- Citations Per Year

- Full text PDF available (1)

Learn More

- Abhimanyu M. Ambalath, Radheshyam Balasundaram, +4 authors M. S. Ramanujan
- IPEC
- 2010

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… (More)

- ‹
- 1
- ›