A Lagrangian relaxation network for graph matching.
Anand RangarajanEric MjolsnessPublished in: IEEE Trans. Neural Networks (1996)
Keyphrases
- graph matching
- lagrangian relaxation
- graph matching algorithm
- pairwise
- pattern recognition
- feasible solution
- graph edit distance
- linear programming
- matching algorithm
- lower bound
- object recognition
- integer programming
- edit distance
- column generation
- inexact graph matching
- branch and bound algorithm
- point sets
- shortest path
- lagrangian heuristic
- lower and upper bounds
- link prediction
- data mining
- dynamic programming
- network structure
- image matching