1. 1. BOOTH K. S. and LUEKER G. S., Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, 1976, 13, pp.335-379.4339620367.68034
2. 2. DEĭNEKO V. G., RUDOLF R. and WOEGINGER G. J., On the Recognition of Permuted Supnick and Incomplete Monge Matrices, SFB Report 05, Spezialforschungsbereich, "Optimierung und Kontrolle", TU Graz, Austria.0858.68042
3. DEMIDENKO V. M., A special case of travelling salesman problems, Izv.Akad. Nauk. BSSR, Ser.fiz.-mat nauk, 1976, 5, pp. 28-32 (in Russian).4564420366.90090
4. 4. FLOOD M. M., The traveling salesman problem, Operations Research, 1956, 4, pp. 61-75.78639
5. 5. GILMORE P. C., LAWLER E. L. and SHMOYS D. B., Well-solved special cases, Chapter 4 in [8], pp. 87-143.8114710631.90081