[igraph] Inexact graph matching

[Khris]

Hi,

I have specific Graph matching problem and I am not sure what's the best way to deal with it. The following is the def:-

We have 2 weighted undirected graphs. In one graph I know the distance of every vertex from every other vertex whereas in another graph I know only which vertices are close to a given vertex. So I know the neighboring vertices given a vertex. So the distance matrix of other Graph is incompletely known. So the question is what's the best way to find the correct alignment between the 2 graphs. Are there any functions in iGraph library which implements those Algorithms?

Ex:- G1 is know the complete distance matrix. For G2, if there are four vertices let's say (v1, v2, v3 v4) the I know edge weight (v1,v2) and (v1,v3)  but have no information of edge weight(v1,v4). Similarly I know about (v2,v3) but no information about edge weights (v2,v4) or (v3,v4). So G2 is incompletely known.

Appreciate any useful feedback and pointers.

Rest fine

Khris.