The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have distinct colors and include the maximum number of colors. We study the approximation complexity of the problem and we provide an inapproximability lower bound. Then we present a heuristic for the problem and an experimental evaluation of our heuristic, both on synthetic and real-world graphs.
翻译:最近,由于时间图的多种应用,人们审议了在时间图中寻找路径的问题。在本文中,我们考虑了问题的一个变体,根据一个顶点颜色的时间图,我们要求找到一个顶点有不同颜色的路径,包括最大颜色的路径。我们研究了问题的近似复杂性,我们提供了一个不相容的下限。然后,我们提出了一个问题杂乱无章,并在合成图和现实图上对我们的超常性进行了实验性评估。