The VFLib graph matching library is a graph matching library which provides several algorithms for graph isomorphism, graph-subgraph isomorphism and graph monomorphism. The library is an efficient implementation of the VF2 graph matching algorithm, currently among the fastest ones, able to process very huge graphs due to its linear memory complexity. The library is written in C++, and can be easily adapted to use different formats for the graphs, and different types of attributes.
The library contains solvers for the following mathing problems:
- Graph Isomorphism
- Subgraph Isomorphism
- Subgraph Monomorphism (VF2 Only)
- Maximum Common Subgraph (VF3 Only)
- A (sub)graph isomorphism algorithm for matching large graphs - Cordella, L.P. and Foggia, P. and Sansone, C. and Vento, M. - IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004 (10.1109/TPAMI.2004.75)
- A large database of graphs and its use for benchmarking graph isomorphism algorithms - De Santo, M. and Foggia, P. and Sansone, C. and Vento, M. - Pattern Recognition Letters, 2003 (10.1016/S0167-8655(02)00253-2)
- A performance comparison of five algorithms for graph isomorphism - P. Foggia and C. Sansone and M. Vento - 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001
- Thirty years of graph matching in pattern recognition - CONTE, D. and FOGGIA, P. and SANSONE, C. and VENTO, M. - International Journal of Pattern Recognition and Artificial Intelligence, 2004 (10.1142/S0218001404003228)
- Graph-Based Methods in Computer Vision: Developments and Applications - Mario Vento and Pasquale Foggia