Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism.

Calin Anton Christopher Neal

Published in: Canadian Conference on AI (2010)

Keyphrases

easy hard easy pattern
subgraph isomorphism
graph matching
sat instances
search tree
edit distance
graph databases
graph mining
weighted graph
depth first search
graph patterns
randomly generated
sat problem
hard problems
data structure
satisfiability problem
frequent subgraphs
object recognition
pattern recognition