An Experimental Study of Phase Transitions in Matching.
Attilio GiordanaMarco BottaLorenza SaittaPublished in: IJCAI (1999)
Keyphrases
- phase transition
- random constraint satisfaction problems
- constraint satisfaction
- combinatorial problems
- satisfiability problem
- np complete
- graph matching
- randomly generated
- hard problems
- random instances
- deep structure
- matching algorithm
- sat problem
- cellular automata
- dynamic programming
- computational complexity
- random graphs
- graph coloring
- upper bound
- random sat