troubleshooting Question

constrained graph matching

Avatar of Dimkov
Dimkov asked on
10 Comments1 Solution242 ViewsLast Modified:
Hi, I am working on skeleton based object matching and have encountered on the fallowing problem in C/C++/C#:

I need to produce a program which matches two graphs.

Input: 2 graphs in any form I want, and any constraints I need

Output: index of how similar the graphs are.

The code must be resistant in missing nodes (ex. couple of nodes are missing from one of the graph).

Since I will be comparing graphs created from proteins, I expect them to be huge and I am hoping to find an algorithm that indexes the graphs for easier matching

I will be thankful for any links, advices, and code  or libraries that I can use

Join the community to see this answer!
Join our exclusive community to see this answer & millions of others.
Unlock 1 Answer and 10 Comments.
Join the Community
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 1 Answer and 10 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros