My Master’s project consists of two fundamental parts. One is Research and the other is Implement. The research part is mostly about investigating graphlet detection and it’s application, as well as discovering the value of using it and by whom. The implement part is very useful mostly for those who use graphlet detection in their project/research and it is also a very genuine idea for any other search engines that could convert to a user-friendly system.
I have searched, found, studied, installed, and tested different systems so far such as GraphletLift, ESCAPE, and PGD. Through all these efforts, I found one system that could satisfy our needs for this project called Graphlet Decomposition. This is a fast, efficient, and parallel algorithm for counting graphlets with a limited size of up to 4 nodes. This method can handle a collection of 300+ networks from different domains.