Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism.

Oleg Verbitsky Maksim Zhukovskii

Published in: ACM Trans. Comput. Log. (2019)

Keyphrases

tight bounds
subgraph isomorphism
upper bound
worst case
graph matching
search tree
graph mining
lower bound
graph databases
pattern recognition
dynamic programming
edit distance
graph pattern matching
maximum common subgraph