- semantic-feasibility? G1 G2 s n mprocedure
Evaluates semantic feasibility of adding vertices n from G1 and m from G2 to the partial mapping s. This can be done by evaluating the vertex attributes between n and m, or by evaluating the edge attributes of n and its neighbours in G1 to that of m and its neighbours in G2.
- G1
- the first graph
- G2
- the second graph
- s
- the partial mapping between G1 and G2. Represented as a set of pairs (N . M) of feasible matches between G1 and G2
- n
- a candidate vertex from G1
- m
- a candidate vertex from G2