Akanksha J. Kulkarni, Swati Bhavsar
Basically Graphs can be used to store any kind of data in the form of vertices and edges. Most of the online structures used graphs to store & model this data. So Graph Partitioning is a strategy to divide a given graph says "Hypergraph" into its smaller sub parts. These smaller parts are nothing but sub-graphs of the original graph. This sub graphs represent the efficient and highly optimized structure of the original Hypergraph. This paper mainly focuses on various techniques used earlier to divide "Positive Hypergraph" into its dense sub-graphs.
Positive Hypergraph, Graph Partitioning