Kavosh

An algorithm for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms. Kavosh is based on counting all k-size sub-graphs of a given graph (directed or undirected). Besides, Kavosh can be employed for finding motifs of size greater than eight, while most of the other algorithms have restriction on motifs with size greater than eight.