Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Science 1 March 1991:
Vol. 251. no. 4997, p. 1007
DOI: 10.1126/science.251.4997.1007
Prev | Table of Contents | Next

Articles

Erratum

In the article "Exact solution of large assymmetric traveling salesman problems" by D. L. Miller and J. F. Pekny (15 Feb., p. 754), the first full paragraph on page 757 should have begun, "In order to determine whether G contains a Hamiltonian cycle, we use...." On page 758, the last sentence of the sixth paragraph should have read, "The Hamiltonian cycle algorithm quickly does the same enumeration by using a bipartite matching algorithm on the admissible graph."

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)