A Partitioning Method for Large Graph Analysis
Shital Deshmukh, Snehal Mohan Kamalapur · 2014
Large graph is one complex data structure. It is used to store and represent information. One must understand its structure and able to decompose it properly without any loss of data. Partitioning or clustering methods are used to decompose a large graph. The proposed graph partitioning method decomposes a large graph into sub graphs. It finds most connected components of every sub graph which are used to form hierarchical representation of sub graph.