1. Cormen, T.H., et al.: Introduction to Algorithms. MIT Press, Cambridge (2001)
2. Johnson, D., McGeoch, L.: The Traveling Salesman Problem: A Case Study. In: Local Search in Combinatorial Optimization, pp. 215–310. John Wiley & Sons, Chichester (1997)
3. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
4. Lecture Notes in Computer Science;D. Karhi,2009
5. Allen, D., Darwiche, A.: Optimal Time-Space Tradeoff in Probabilistic Inference. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (2003)