Graph matching by relaxation of fuzzy assignments.
Graphs are very powerful and widely used representational tools in computer applications. We present a relaxation approach to (sub)graph matching based on a fuzzy assignment matrix. The algorithm has a computational complexity of O(n2m2) where n and m are the number of nodes in the two graphs being...
| Publié dans: | IEEE Transactions on fuzzy systems 9, 1 (2001). |
|---|---|
| Auteur principal: | |
| Format: | Article |
| Langue: | English |
| Sujets: |