1. Ascheuer N., Jünger M. and Reinelt G. (2000). A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17(1): 61–84
2. Biggs N., Lloyd E.K. and Wilson R.J. (1986). Graph theory. Clarendon Press, Oxford, 1736–1936
3. Chan, E.P.F., Zhang, N.: Finding shortest paths in large network systems. In: Proceedings of the 9th ACM international symposium on Advances in geographic information systems, pp. 160–166. ACM Press (2001).http://www.doi.acm.org/10.1145/512161.512197
4. Cormen T.H., Leiserson C.E. and Rivest R.L. (1990). Introduction to algorithms. MIT Press/McGraw-Hill, New York
5. Hadjieleftheriou, M., Kollios, G., Bakalov, P., Tsotras, V.J.: Complex spatio-temporal pattern queries. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.Å., Ooi, B.C. (eds.) Proceedings of the 31st International Conference on Very Large Data Bases: VLDB’05, pp. 877–888 (2005)