Access Restriction

Author Pohl, Ira
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The use of Warnsdorff's rule for finding a knight's tour is generalized and applied to the problem of finding a Hamilton path in a graph. A graph-theoretic justification for the method is given.
Description Affiliation: Stanford Univ., Stanford, CA (Pohl, Ira)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 10
Issue Number 7
Page Count 4
Starting Page 446
Ending Page 449

Open content in new tab

   Open content in new tab
Source: ACM Digital Library