Finding Colorful Paths in Temporal Graphs

The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant the that, given vertex-colored graph, asks for path whose vertices have distinct colors and include maximum number colors. We study approximation complexity provide an inapproximability lower bound. Then present heuristic experimental evaluation our heuristic, both on synthetic real-world graphs.