An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching
Min Chih LinMichel J. MizrahiJayme Luiz SzwarcfiterPublished in: CoRR (2013)
Keyphrases
- matching algorithm
- optimization algorithm
- times faster
- learning algorithm
- computational complexity
- detection algorithm
- matching process
- computational cost
- similarity measure
- disparity map
- simulated annealing
- experimental evaluation
- cost function
- significant improvement
- probabilistic model
- improved algorithm
- np hard
- expectation maximization
- computationally efficient
- k means
- recognition algorithm
- convergence rate
- matching scheme
- pattern matching
- graph cuts
- input data
- linear programming
- multi objective
- optimal solution