An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing.
Hashem EzzatiMahmood AmintoosiHashem TabasiPublished in: CoRR (2019)
Keyphrases
- upper bound
- graph isomorphism
- simulated annealing
- lower bound
- graph mining
- worst case
- genetic algorithm
- branch and bound algorithm
- graph search
- subgraph isomorphism
- metaheuristic
- combinatorial optimization
- graph databases
- evolutionary algorithm
- optimal solution
- branch and bound
- special case
- query processing
- pairwise
- conp complete