Eugene C. Freuder
- 1 BERGE, C Graphs and Hypergraphs. North Holland, London, 1973. Google Scholar
- 2 BITNER, J.R., AND REINGOLD, E M Backtrack programming techniques. Commun A CM 18, 11 (Nov. 1975), 651-656. Google Scholar
- 3 BoBROW, D G, AND RAPHAEL, B New programming languages for artlficml tntelhgence research Comput Surv. 6, 3 (Sept. 1974), 153-174. Google Scholar
- 4 FREUDER,. E.C. Synthesizing constraint expressions. Commun. A CM 21, i1 (Nov 1978), 958-966 Google Scholar
- 5 GASCHNIG, J Experimental case studies of backtrack vs Waltz-type vs new algor,thms for satlsficmg assignment problems. Proc. 2rid Nat Conf of the Canadxan Society for Computat,onal Studies of Intelligence, Toronto, Ontano, 1978, pp. 268-277Google Scholar
- 6 KNUTH, D E. Estlmattng the efficiency of backtrack programs Math. Comput 29 (Jan 1975), 121-136.Google Scholar
- 7 MACKWORTH, A.K Consistency in networks of relations Artif. Intell. 8 (1977), 99-118Google Scholar
- 8 MATULA, D.W A ram-max theorem for graphs with apphcation to graph coloring SlAM Rev I0 (1968), 481-482Google Scholar
- 9 MATULA, O W, MARBLE, G, Arid ISAACSON, J.D Graph coloring algorithms In Graph Theory and Computing, R C Read, Ed, Academtc Press, New York, 1972, pp 109-122Google Scholar
- 10 NILSSON, N J. Problem-Solving Methods m Art~clai Intelligence McGraw-Hill, New York, 1971 Google Scholar
- 11 PURDOM, P W.Tree size by partial backtracking. SIAM d. Comput 7 (1978), 481-491.Google Scholar
- 12 SZEKERES, G., AND WILF, H S.Aa mequahty for the chromatic number of a graph J Comb Theory 4 (1968), 1-3.Google Scholar
- 13 TENENBAUM, J M, AND BARROW, H.G IGS A paradigm for mtegraUng image segmentation and interpretation. In Pattern Recogmtton and Artificial lntelhgence, C.H. Chen, Ed. Academic Press, New York, 1976, pp 472-507Google Scholar
- 14 WALTZ, D.L Understanding line drawmgs of scenes with shadows. In The Psychology of Computer Vision, P H Winston, Ed, McGraw-Hall, New York, 1975, pp 19-91.Google Scholar
- 15 WELLS, M B. Elements of Combinatorial Computing Pergamon Press, New York, 1971.Google Scholar
- 16 WIRTH.N Algorithms + Data Structures --- Programs Prentice-Hall, Englewood Cliffs, N J, 1976 Google Scholar
Index Terms
- A Sufficient Condition for Backtrack-Free Search
Recommendations
A sufficient condition for backtrack-bounded search
Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis ...
A new necessary and sufficient global optimality condition for canonical DC problems
The paper proposes a new necessary and sufficient global optimality condition for canonical DC optimization problems. We analyze the rationale behind Tuy's standard global optimality condition for canonical DC problems, which relies on the so-called ...
A Necessary and Sufficient Condition for Approachability
In the framework of two-person repeated games with vector payoffs, Blackwell defined the property of approachability and introduced a sufficient condition for it. He also proved that this condition is necessary in the case of convex sets.
We generalize ...
Comments