User:Fabior1984/Sandbox1

In graph theory, VF algorithm is a graph-matching algorithm which is able to efficiently solve graph isomorphism and subgraph isomorphism problems . It's particularly suited to work with very large graphs and it's an evolution of the backtracking procedure for solving the subgraph isomorphism problem proposed by Julian R. Ullman in 1976.

The algorithm
Given two graphs $$G_1=(V_1,E_1)$$ and $$G_2=(V_2,E_2)$$, the VF algorithm creates a mapping $$M$$.