Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.
Danny HermelinMatthias MnichErik Jan van LeeuwenPublished in: Algorithmica (2014)
Keyphrases
- graph matching
- parameterized complexity
- graph matching algorithm
- graph edit distance
- pairwise
- object recognition
- matching algorithm
- edit distance
- inexact graph matching
- adjacency matrix
- pattern recognition
- point sets
- subgraph isomorphism
- fixed parameter tractable
- pattern matching
- vector space
- attributed graphs
- global constraints
- machine learning
- computational problems
- image matching
- similarity measure