Jump to content

Graph matching algorithms and books


Recommended Posts



I am start working with graph matching.


I need suggestions for good books and algorithms, in the topic graph matching, can someone help-me?


My problem can be statement as following:


There is two attributed graphs Gm=(Vm,Em) and Gd=(Vd,Ed) that should be merged. Each node vi in Vm contains 3 atributes, number of edges (in and out), area and color. Each node vi in Vd contains 3 atributes, number of edges (in and out), area and name. This should be formulated with an inexact graph matching problem with option for multiples nodes in Gm could be associated to one node in Vd.


I am trying to formulate the fitness functions, but i need examples to do this the right way. Can also you give-me a clue of the best algorithm to touch this problem?






Link to comment
Share on other sites

  • 4 weeks later...

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.