Re: [igraph] matching 2 weighted graphs

[Tamás Nepusz]

Hello,

The igraph library does not address the problem you describe; what you describe 
is usually referred to as the "weighted inexact graph matching" problem. The 
following page claims that simulated annealing is a feasible approach to solve 
this:

http://randomwalker.info/luther/kaggle-deanonymization/Graph_Matching_via_Simulate.html

-- 
T.


On Monday, 18 June 2012 at 09:23, Anup Bhatkar wrote:

> Hello,
> 
> I have to match 2 undirected weighted graphs both having same number of 
> vertices and both are fully connected. I want to match these 2 graphs in such 
> a way that the difference in edge weight is minimum preferrably 0 if perfect 
> isomorphism exist. So matching should be such that difference in edge weight 
> is minimum after the matching. I checked the isomorphism() function of the 
> library but that does not seem to address the problem in hand.
> 
> Please suggest appropriate function to be used if one such exist?
> 
> Thanks in advance.
> 
> Regards
> Khris.
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help