Ear-decompositions and the complexity of the matching polytope.
Yohann BenchetritAndrás SeböPublished in: CoRR (2015)
Keyphrases
- matching algorithm
- feature points
- graph matching
- complexity analysis
- matching process
- database
- stable set
- matching scheme
- computational cost
- feature matching
- image matching
- knapsack problem
- lattice points
- semidefinite
- directed graph
- convex hull
- range images
- pattern matching
- worst case
- upper bound
- computational complexity
- genetic algorithm
- neural network
- data sets