Bounding the Phase Transition on Edge Matching Puzzles.
Ramón BéjarCèsar FernándezCarles MateuNuria PascualPublished in: ISMVL (2009)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- randomly generated
- combinatorial problems
- np complete
- constraint satisfaction problems
- random constraint satisfaction problems
- hard problems
- matching algorithm
- sat problem
- graph coloring
- pattern matching
- upper bound
- cellular automata
- random instances
- deep structure
- graph matching
- average degree
- constraint programming
- random graphs
- heuristic search
- orders of magnitude
- stochastic local search
- image matching
- subgraph isomorphism
- random sat