berkus
/
vf2
mirror of https://github.com/OwenTrokeBillard/vf2.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
VF2 subgraph isomorphism algorithm in Rust.
2 Commits 1 Branch 0 Tags 69 KiB
Rust 100%
Go to file
Owen Troke-Billard 8a4c88eff9 Copy code from private repository 2024-09-16 10:39:31 -06:00
src Copy code from private repository 2024-09-16 10:39:31 -06:00
tests Copy code from private repository 2024-09-16 10:39:31 -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 Copy code from private repository 2024-09-16 10:39:31 -06:00

README.md

gb_vf2pp — VF2++ in Rust

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

Features

This is a work in progress. Some features are not yet implemented.

  • Enumerate graph isomorphisms
  • Enumerate subgraph isomorphisms
  • Enumerate induced subgraph isomorphisms
  • Find minimum cost isomorphism
  • Support directed graphs
  • Support undirected graphs
  • Support disconnected graphs
  • Support node labels
  • Support edge labels
  • Graph trait
  • Performance benchmarks
  • Test databases
  • Examples

Remaining work

  • Implement VF2 cutting rules
  • Implement all of VF2++ (only VF2 implemented so far)

References

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

[2] 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. 1367–1372, Oct. 2004, doi: https://doi.org/10.1109/tpami.2004.75.