A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Relaxation in graph coloring and satisfiability problems
1999
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
Preserved Fulltext
Other Versions
Using T=0 Monte Carlo simulation, we study the relaxation of graph coloring (K-COL) and satisfiability (K-SAT), two hard problems that have recently been shown to possess a phase transition in solvability as a parameter is varied. A change from exponentially fast to power law relaxation, and a transition to freezing behavior are found. These changes take place for smaller values of the parameter than the solvability transition. Results for the coloring problem for colorable and clustered graphs
doi:10.1103/physreve.59.3983
fatcat:euqefribgndudfkwztn3xte6yy