Some Hamilton Paths and a Minimal Change Algorithm
Peter Eades, Michael Hickey, Ronald C. Read · Journal of the ACM · 1984
article Free Access Share on Some Hamilton Paths and a Minimal Change Algorithm Authors: Peter Eades Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067 Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067View Profile , Michael Hickey Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067 Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067View Profile , Ronald C. Read Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1View Profile Authors Info & Claims Journal of the ACMVolume 31Issue 1Jan. 1984 pp 19–29https://doi.org/10.1145/2422.322413Published:01 January 1984Publication History 34citation1,473DownloadsMetricsTotal Citations34Total Downloads1,473Last 12 Months163Last 6 weeks21 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 50 works. doi:10.1145/2422.322413