1. J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms;Aho,1974
2. A. D'Atri, On the structure of combinatorial problems and structure preserving reductions, in: A. Salomaa and M. Steinby, eds., Automata, Languages and Programming, Lecture Notes in Computer Science 52;Ausiello,1977
3. Applied Dynamic Programming;Bellman,1962
4. Problems polynomially equivalent to graph isomorphism;Booth,1976
5. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem. Math. Programming, to appear.