Node product graph - Example
Assume we have the following compatible elements:
a:(A1,B1) b:(A1,B3) c:(A2,B2) d:(A2,B4)
e:(A3,B3) f:(A3,B1) g:(A4,B2) h:(A4,B4)
And the following relations are similar:
The same for a-e, b-f, c-e, d-g
h
g
f
a
e
b
d
c
Maximal clique {a,c,e}
{A1,A2,A3} similar to
{B1,B2,B3}
Previous slide
Next slide
Back to first slide
View graphic version