1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Bellman, R.: Combinatorial Processes and Dynamic Programming. In: Bellman, R., Hall Jr., M. (eds.) Proceedings of Symposia in Applied Mathematics. Combinatorial Analysis, vol. 10, pp. 217–249. American Mathematical Society (1960)
3. Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. J.Assoc.Comput.Mach. 9, 61–63 (1962)
4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius Inversion and Graphs of Bounded Degree. In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). Dagstuhl Seminar Proceedings 08001, pp. 85–96. IBFI Schloss Dagstuhl (2008)
5. Chung, F.R.K., Frankl, P., Graham, R.L., Shearer, J.B.: Some Intersection Theorems for Ordered Sets and Graphs. J.Combinatorial Theory Ser.A 43, 23–37 (1986)