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^[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 edit

Given two graphs $G_{1}=(V_{1},E_{1})$ and $G_{2}=(V_{2},E_{2})$ , the VF algorithm creates a mapping $M$ .

Performances edit

VF2 Algorithm edit

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)

This article is a stub. You can help Wikipedia by expanding it.

[1] 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)

[1]