VF2 subgraph isomorphism algorithm in Rust.
Go to file
Owen Troke-Billard da151176fe Change VF2++ to VF2 2024-09-16 10:46:47 -06:00
src Change VF2++ to VF2 2024-09-16 10:46:47 -06:00
tests Change VF2++ to VF2 2024-09-16 10:46:47 -06:00
.gitignore Copy code from private repository 2024-09-16 10:39:31 -06:00
Cargo.toml Copy code from private repository 2024-09-16 10:39:31 -06:00
README.md Change VF2++ to VF2 2024-09-16 10:46:47 -06:00

README.md

vf2 — VF2 subgraph isomorphism algorithm in Rust

This crate implements the VF2 subgraph isomorphism algorithm [1]. It can find graph isomorphisms, subgraph isomorphisms, and induced subgraph isomorphisms.

Features

  • Enumerate graph isomorphisms
  • Enumerate subgraph isomorphisms
  • Enumerate induced subgraph isomorphisms
  • Support directed graphs
  • Support undirected graphs
  • Support disconnected graphs
  • Support node labels
  • Support edge labels
  • Graph trait

Remaining work

  • Implement VF2 cutting rules

References

[1] L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, “A (sub)graph isomorphism algorithm for matching large graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 10, pp. 13671372, Oct. 2004, doi: https://doi.org/10.1109/tpami.2004.75.

[2] A. Jüttner and P. Madarasi, “VF2++—An improved subgraph isomorphism algorithm,” Discrete Applied Mathematics, vol. 242, pp. 6981, Jun. 2018, doi: https://doi.org/10.1016/j.dam.2018.02.018.