Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.

Andre Droschinsky Nils M. Kriege Petra Mutzel

Published in: CoRR (2016)

Keyphrases

search tree
search space
orders of magnitude
computationally efficient
theoretical analysis
times faster
graph theory
real time
optimization problems
recently developed
data structure
significant improvement
computational cost
combinatorial optimization
highly efficient