On finding rainbow and colorful paths

Theor. Comput. Sci., Volume 628, 2016, Pages 110-114.

Cited by: 11|Bibtex|Views9|Links
EI

Abstract:

In the Colorful Path problem we are given a graph G = ( V , E ) and an arbitrary vertex coloring function c : V ? k . The goal is to find a colorful path, i.e., a path on k vertices, that visits each color. This problem has been introduced in the classical work of Alon et al. (1995) 1, and the authors proposed a dynamic programming algori...More

Code:

Data:

Your rating :
0

 

Tags
Comments