Fast algorithms for some dominating induced matching problems.
Min Chih LinMichel J. MizrahiJayme Luiz SzwarcfiterPublished in: Inf. Process. Lett. (2014)
Keyphrases
- optimization problems
- test problems
- hard problems
- benchmark problems
- run times
- np hard problems
- related problems
- search methods
- times faster
- matching algorithm
- orders of magnitude
- computational complexity
- learning algorithm
- worst case
- greedy algorithms
- computational problems
- difficult problems
- theoretical analysis
- inference problems
- exact algorithms
- problems in computer vision
- significant improvement
- benchmark datasets
- search problems
- partial solutions
- objective function
- graph theory
- theoretical guarantees
- computational cost
- genetic algorithm
- data mining
- data sets