A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
Brijnesh J. JainKlaus ObermayerPublished in: CoRR (2009)
Keyphrases
- maximum weight
- sufficient conditions
- graph matching
- bipartite graph matching
- tree matching
- efficiently computable
- bipartite graph
- minimum weight
- independent set
- partial order
- pairwise
- graph matching algorithm
- weighted graph
- object recognition
- matching algorithm
- inexact graph matching
- pattern recognition
- np hard
- point sets
- association graph
- neural network
- image matching
- learning algorithm
- pattern matching
- upper bound
- support vector machine
- special case
- genetic algorithm