The purpose of this project is to implement the algorithms for counting subgraphs using framework Graph Motif Parameters, and test if our algorithms are more efficient in time.
As defined by Radu Curticapean, Holger Dell, Dániel Marx in Homomorphisms Are a Good Basis for Counting Small Subgraphs
Different languages are used:
- Python
- C++
Have a look at the wiki dfdfsdadf