FIEGER, Kai; BALYO, Tomas; SCHULZ, Christian; SCHREIBER, Dominik. Finding Optimal Longest Paths by Dynamic Programming in Parallel. Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 10, n. 1, p. 61–69, 2021. DOI: 10.1609/socs.v10i1.18503. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18503. Acesso em: 27 may. 2026.