A branch&cut algorithm for the maximum common edge subgraph problem.
Gordana ManicLaura BahienseCid C. de SouzaPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- search space
- preprocessing
- significant improvement
- worst case
- np hard
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- experimental evaluation
- computational cost
- times faster
- detection algorithm
- expectation maximization
- simulated annealing
- cost function
- high accuracy
- k means
- recognition algorithm
- genetic algorithm
- linear programming
- particle swarm optimization
- objective function
- optimization algorithm
- similarity measure
- tree structure
- matching algorithm
- image processing
- edge weights
- edge detection algorithm