An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks

With the increasing scale and complexity of today's communication network, it is becoming more essential to find the frequent subgraph of a time series of communication network to predict the nodes which are often involved in the communication. This knowledge is useful in devising new routing algorithms, and understanding the frequent communication patterns. It is often required to determine the frequency of a query graph in the graph database to realize how much that query graph is occurred in the communication network and it facilitates to monitor the performance of the nodes which are presented in the query graph. When a query graph does not have an exact match with the graphs in the graph database, the idea of finding approximate match of the query graph is coined to determine the frequency of the query graph by relaxing few edges of it. This paper presents an algorithm which decides whether the query graph is frequent as expected times in the graph database, if not so then the algorithm relax infrequent edges from the query graph to find the subgraph of the query graph with the given minimum support threshold.