An Approach to Handle Dynamic Graph Partitioning

Abstract

Large Dynamic Graphs are the big data structures. Now days it is important to study the dynamic graphs as there are different graphs are prepared like facebook, twitter, network analysis. Large Dynamic graphs are difficult to analyze. More memory is required to load this kind of graphs. Large graphs consist of complex data structure. To view these graphs in understandable form one has to make the partitions of the graph. Making partition will create overlapping sub graphs. Overlapping sub graphs will contain repeating nodes or some common nodes. These partitions can easily be analyzed and used for further processing. Dynamic graph always gets the addition or deletion of the contents like edge insertion or deletion and node insertion and deletion. There are updations which can be reflected in the sub graphs. The proposed system works on the same kind of graphs where large graph is partitioned into sub graphs.