Backtrack Programming
Journal of the ACM · 1965 · 485 citations · 6 references
A widely used method of efftcient search is examined in detail. This examination provides the opportunity to formulate its scope and methods in their full generality. In addL tion to a general exposition of the basic process, some important refinemertts are indicated. Examples are given which illustrate the salient features of this searching process.
6
R. G. Gallager, W. W. Peterson · Mathematics of Computation · 1962
2.1K citations
Hendrik Mann, W. W. Peterson · Technometrics · 1961
906 citations
S. W. Golomb, Basil Gordon, L. R. Welch · Canadian Journal of Mathematics · 1958
219 citations
Discovery of an Hadamard matrix of order 92
L. D. Baumert, S. W. Golomb, Marshall Hall · Bulletin of the American Mathematical Society · 1962
79 citations
Regent Results in Comma-Free Codes
B. H. Jiggs · Canadian Journal of Mathematics · 1963
50 citations