Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism.

Oleg Verbitsky Maksim Zhukovskii

Published in: CoRR (2018)

Keyphrases

tight bounds
subgraph isomorphism
upper bound
worst case
lower bound
graph matching
graph pattern matching
maximum common subgraph
query processing
branch and bound
graph databases
hard problems
object recognition
relational databases
nearest neighbor