Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise.
Jialing LiuVikas YadavHullas SehgalJoshua M. OlsonHaifeng LiuNicola EliaPublished in: CDC/ECC (2005)
Keyphrases
- phase transition
- random graphs
- constraint satisfaction
- satisfiability problem
- np complete
- randomly generated
- graph coloring
- random instances
- connected graphs
- hard problems
- np complete problems
- cellular automata
- random constraint satisfaction problems
- evolutionary algorithm
- constraint satisfaction problems
- sat problem