Finding matchs betwen 2 and more graphs

Do you know a function that can filter all possible similarities (matchs) between 2 and more graphs ?

Answer 1

[Walter Roberson]

No.

For fairly reasonable definitions of "similarities" or "matches", and of "graphs", and of "filter", it can be demonstrated that the problem is unsolvable in finite time.

[Joel Sande]

Yes I understand that it is hard to find a solution to the qeustion. I have implemented a kind of solution regarding what I mean by similarity. Unfortunately I have to publish the paper before showing the code(in a few week), because nobody has done that before.

[Walter Roberson]

Defining what you mean by the terms would be a start.