Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism.

Calin Anton Lane Olson

Published in: Canadian Conference on AI (2009)

Keyphrases

easy hard easy pattern
subgraph isomorphism
sat instances
graph matching
edit distance
graph databases
weighted graph
search tree
graph mining
depth first search
hard problems
pattern recognition
application domains
graph patterns
frequent subgraphs