Backtrack Programming

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.

[1]  S. Golomb,et al.  Comma-Free Codes , 1958, Canadian Journal of Mathematics.

[2]  B. H. Jiggs,et al.  Regent Results in Comma-Free Codes , 1963, Canadian Journal of Mathematics.

[3]  L. D. Baumert,et al.  Discovery of an Hadamard matrix of order 92 , 1962 .

[4]  S. Lin,et al.  ON SEQUENTIAL DECODING , 1967 .

[5]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[6]  Hans Salié.  Zur Verteilung natürlicher Zahlen auf elementfremde Klassen , 1954, Zur Verteilung natürlicher Zahlen auf elementfremde Klassen.

[7]  Jacob Ziv.  Coding and decoding for time-discrete amplitude-continuous memoryless channels , 1962, IRE Trans. Inf. Theory.

[8]  E. Netto,et al.  Lehrbuch der Combinatorik , 1902 .

[9]  Rufus Walker,et al.  An enumerative technique for a class of combinatorial problems , 1960 .