Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.
Danny HermelinMatthias MnichErik Jan van LeeuwenPublished in: CoRR (2012)
Keyphrases
- graph matching
- parameterized complexity
- graph matching algorithm
- graph edit distance
- subgraph isomorphism
- pairwise
- inexact graph matching
- pattern recognition
- object recognition
- matching algorithm
- point sets
- edit distance
- fixed parameter tractable
- global constraints
- adjacency matrix
- pattern matching
- neural network
- machine learning