1 paper
Till Fluschnik, Leon Kellerhals, Malte Renken
We introduce the algorithmic problem of finding a locally rainbow path of length ℓ connecting two distinguished vertices s and t in a vertex-colored directed graph. Herein…