1. 1. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The design and Analysis of Computer Algorithms, Addision Wesley, Reading MA., 1974.4135920326.68005
2. 2. GAREY M. and JOHNSON D., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman & Company, San Fransisco, 1979.5190660411.68039
3. 3. ITAI A., PAPADIMITRIOU C. H. and SZWARCFITER J., Hamilton paths in grid graphs, SIAM J. Computing, November 1982, 11, 4, pp. 676-686.6776610506.05043
4. 4. KARP R. M. and RAMACHANDRAN V., A survey of parallel algorithms for shared-memory machines, Technical Report CSD 88/408, UCB, 1988.0900.68267
5. 5. ANGLUIN D. and VALIANT L., Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, J. Computer Syst., 1979, 18, pp. 155-193.5321740437.05040