Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.
MohammadTaghi HajiaghayiNaomi NishimuraPublished in: J. Comput. Syst. Sci. (2007)
Keyphrases
- bounded treewidth
- subgraph isomorphism
- np complete
- graph matching
- maximum common subgraph
- graph isomorphism
- graph databases
- conjunctive queries
- search tree
- edit distance
- weighted graph
- graph mining
- boolean functions
- decision problems
- relational learning
- graph patterns
- frequent subgraphs
- query language
- np hard
- pattern recognition
- relational data
- information retrieval
- query evaluation
- matching algorithm