An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching.
Min Chih LinMichel J. MizrahiJayme Luiz SzwarcfiterPublished in: ISAAC (2013)
Keyphrases
- matching algorithm
- matching process
- objective function
- times faster
- preprocessing
- computational complexity
- k means
- cost function
- experimental evaluation
- learning algorithm
- high accuracy
- detection algorithm
- expectation maximization
- string matching
- probabilistic model
- np hard
- optimal solution
- computational cost
- dynamic programming
- theoretical analysis
- optimization algorithm
- clustering method
- energy function
- significant improvement
- search space
- weighted distance
- voting scheme
- improved algorithm
- distance transform
- recognition algorithm
- tree structure
- particle swarm optimization
- input data
- simulated annealing