*The parallel version has been integreted in the official vf3lib repository
This library contains a parallel version of VF3. The library has been completely renewed and has been designed to be extendend with pure c++ parallel structures.
Actually the library contatins the algorithms VF3P and VF3P-LS described in the following paper:
A Parallel Algorithm for Subgraph Isomorphism - V. Carletti, P. Foggia, P. Ritrovato, M. Vento, V. Vigilante - International Workshop on Graph-Based Representations in Pattern Recognition 2019 https://link.springer.com/chapter/10.1007/978-3-030-20081-7_14
If you use this algorithm, please cite also the following references:
- Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3 - Carletti V., Foggia P., Saggese A., Vento M. - IEEE transactions on pattern analysis and machine intelligence - 2018
- Introducing VF3: A new algorithm for subgraph isomorphism - Carletti V., Foggia P., Saggese A., Vento M. - International Workshop on Graph-Based Representations in Pattern Recognition - 2017
- The VF3-Light Subgraph Isomorphism Algorithm: When Doing Less Is More Effective - V. Carletti, P. Foggia, A. Greco, A. Saggese, M. Vento - Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) - 2018
- A Parallel Algorithm for Subgraph Isomorphism - V. Carletti, P. Foggia, P. Ritrovato, M. Vento, V. Vigilante - International Workshop on Graph-Based Representations in Pattern Recognition - 2019