An enumeration algorithm for efficient k-graphlet enumeration and counting based on Binary Space Partitioning technique. The algorithm works on all the input graphs but performs quite efficiently on graphs that have bounded degree, i.e. all the nodes do not exceed a fixed maximum degree d
