## A Graduated Assignment Algorithm for Graph Matching (1996)

### Cached

### Download Links

- [www.cis.ufl.edu]
- [ipag.med.yale.edu]
- [cbio.ensmp.fr]
- [www.cs.yale.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 288 - 15 self |

### BibTeX

@MISC{Gold96agraduated,

author = {Steven Gold and Anand Rangarajan},

title = {A Graduated Assignment Algorithm for Graph Matching},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity [O(lm), where l and m are the number of links in the two graphs] and robustness in the presence of noise offer advantages over traditional combinatorial approaches. The algorithm, not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching, and attributed relational graph matching. To illustrate the performance of the algorithm, attributed relational graphs derived from objects are matched. Then, results from twenty-five thousand experiments conducted on 100 node random graphs of varying types (graphs with only zero-one links, weighted graphs, and graphs with node attributes and multiple link types) are reported. No comparable results have...