An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms.
Jurij MihelicUros CibejPublished in: Open Comput. Sci. (2021)
Keyphrases
- subgraph isomorphism
- backtracking algorithms
- search algorithm
- search tree
- constraint propagation
- graph matching
- constraint networks
- constraint satisfaction
- path consistency
- constraint satisfaction problems
- graph databases
- non binary
- graph mining
- search space
- hard problems
- branch and bound
- backtracking search
- weighted graph
- graph patterns
- branch and bound algorithm
- depth first search
- pattern recognition
- edit distance
- constraint programming
- graph data
- temporal constraints
- temporal reasoning
- frequent subgraphs
- mining algorithm
- heuristic search
- orders of magnitude