Ordering Continuing Functions set in Backtracking Algorithms

The paper shows how continuing functions inBacktracking algorithm can order, prove existence of bestcontinuing function and evaluate complexity of Backtrackingalgorithm for best continuing function usage.

Bibliographic Details
Main Author: Tiberiu Socaciu
Format: Article
Language:English
Published: Stefan cel Mare University of Suceava 2008-01-01
Series:Journal of Applied Computer Science & Mathematics
Subjects:
Online Access:http://www.jacs.usv.ro/getpdf.php?issue=3&paperid=36