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 leads to upper bounds on the effort required fo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 1985-10, Vol.32 (4), p.755-761
1. Verfasser:	FREUDER, E. C
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Graphs Joints Preprocessing Searching Theoretical computing Trees Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!