Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-93409-5_46 | COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 1 |
Keywords | DocType | Volume |
Temporal graphs, Algorithms on graphs, Algorithms for network analysis, Heuristics, Approximation complexity | Conference | 1015 |
ISSN | Citations | PageRank |
1860-949X | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Riccardo Dondi | 1 | 89 | 18.42 |
| Mohammad Mehdi Hosseinzadeh | 2 | 0 | 1.01 |