PLANKEN, Léon; DE WEERDT, Mathijs; VAN DER KROGT, Roman. Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. Proceedings of the International Conference on Automated Planning and Scheduling, [S. l.], v. 21, n. 1, p. 170–177, 2011. DOI: 10.1609/icaps.v21i1.13465. Disponível em: https://ojs.aaai.org/index.php/ICAPS/article/view/13465. Acesso em: 26 may. 2026.