Backtrack search algorithms are procedures capable of deciding whether a decision problem has a solution or not through a sequence of trials and errors. Analysis of the performances of these procedures is a long-standing open problem in theoretical computer science. I present some statistical physics ideas and techniques to attack this problem. The approach is illustrated on the colouring of random graphs, and some current limitations and perspectives are presented.
CITATION STYLE
Monasson, R. (2004). On the Analysis of Backtrack Proceduresfor the Colouring of Random Graphs (pp. 235–254). https://doi.org/10.1007/978-3-540-44485-5_11
Mendeley helps you to discover research relevant for your work.