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.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Lendak, Imre I.; Erdeljan, Aleksandar M.; Popović, Dragan S.: Algorithm for cataloging topologies in the common information model (CIM) (2011)
- De Santo, M.; Foggia, P.; Sansone, C.; Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms (2003)