Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.
Matsuo KonagayaYota OtachiRyuhei UeharaPublished in: Discret. Appl. Math. (2016)
Keyphrases
- graph isomorphism
- subgraph isomorphism
- graph matching algorithm
- graph matching
- graph databases
- subgraph mining
- graph search
- graph theory
- graph mining
- maximum common subgraph
- graph data
- labeled graphs
- polynomial time complexity
- weighted graph
- frequent subgraphs
- hard problems
- graph pattern matching
- depth first search
- edit distance
- search tree
- graph patterns
- data mining
- np complete
- directed graph
- index structure
- similarity measure