Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs.
Matsuo KonagayaYota OtachiRyuhei UeharaPublished in: TAMC (2014)
Keyphrases
- subgraph isomorphism
- graph isomorphism
- graph matching algorithm
- graph matching
- graph databases
- subgraph mining
- graph theory
- graph data
- graph mining
- maximum common subgraph
- graph search
- labeled graphs
- polynomial time complexity
- edit distance
- hard problems
- weighted graph
- graph pattern matching
- frequent subgraphs
- graph model
- edge weights
- depth first search
- graph patterns
- data structure
- search algorithm
- data mining techniques
- np complete
- shortest path
- graph kernels
- structured data
- image matching
- bipartite graph
- graph structure
- search tree