K. Fieger, T. Balyo, C. Schulz, and D. Schreiber, “Finding Optimal Longest Paths by Dynamic Programming in Parallel”, SOCS, vol. 10, no. 1, pp. 61–69, Sep. 2021.