Sign in to follow this  
ballack

graph matching

Recommended Posts

Try this site:
Click

Also, if you need a more general definition of some common graph matching problems I can help you out there.

Isomorphism: Two graphs are isomorphic if and only if one graph can be "reshaped/relabeled" to become the other.

Equality: Two graphs are equal if and only if the graphs in the exact same shape and have the shape/labels. All equalivelent graphs are also isomorphic.

Subgraph matching: If one graph is equalivelent to a subgraph of a larger graph, then one subgraph matches another graph.

Share this post


Link to post
Share on other sites

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

Sign in to follow this