Planken, L. et al. 2011. Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. Proceedings of the International Conference on Automated Planning and Scheduling. 21, 1 (Mar. 2011), 170–177. DOI:https://doi.org/10.1609/icaps.v21i1.13465.