In graph theory, VF algorithm is a graph-matching algorithm which is able to efficiently solve graph isomorphism and subgraph isomorphism problems[1] . 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
editGiven two graphs and , the VF algorithm creates a mapping .
Performances
editThis section needs expansion. You can help by adding to it. |
VF2 Algorithm
editThis section needs expansion. You can help by adding to it. |
References
edit- ^ L. P. Cordella, P. Foggia, C. Sansone, and M. Vento (2001). "An improved algorithm for matching large graphs". 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Cuen: 149–159.
{{cite journal}}
: CS1 maint: multiple names: authors list (link)