The condensation phase transition in random graph coloring.
Victor BapstAmin Coja-OghlanSamuel HetterichFelicia RaßmannDan VilenchikPublished in: CoRR (2014)
Keyphrases
- graph coloring
- phase transition
- random instances
- randomly generated
- random constraint satisfaction problems
- np complete problems
- combinatorial problems
- constraint satisfaction
- easy hard easy pattern
- hamiltonian cycle
- satisfiability problem
- random sat
- hard problems
- np complete
- sat problem
- cellular automata
- symmetry breaking
- constraint satisfaction problems
- computational complexity
- evolutionary algorithm