1. Bast, H., Delling, D., Goldberg, A.V., Müller–Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. In: Technical Report MSR-TR-2014-4. Microsoft Research, Mountain View (2014)
2. Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics 18, 1–43 (2013)
3. Lecture Notes in Computer Science;R. Bauer,2013
4. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inform. and Comput. 208, 259–275 (2010)
5. Chaudhuri, S., Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica 27, 212–226 (2000)