|
From: | Khris |
Subject: | [igraph] Inexact graph matching |
Date: | Tue, 3 Jul 2012 19:42:13 +0530 |
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:- 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. |
[Prev in Thread] | Current Thread | [Next in Thread] |