Tree-depth and the Formula Complexity of Subgraph Isomorphism.

Deepanshu Kush Benjamin Rossman

Published in: Electron. Colloquium Comput. Complex. (2020)

Keyphrases

subgraph isomorphism
graph matching
tree structure
graph pattern matching
maximum common subgraph
search tree
hard problems
database systems
pattern recognition
data model
phase transition
edit distance