Santosh Nage, Girish Potdar
Abstract: In real life, there are many problems like shortest path, graph coloring, travelling Salesmen problem (TSP) etc, thus providing solution to each problem is nearly or highly impossible with the help of traditional methods in reasonable amount of time. But it may be possible with the help of heuristic approach. It provides solution but dont guarantee optimal solution. Graph partitioning problems are NP-Complete problems, partitioning graph into p-partitions using multilevel method, spectral method etc. for various purposes.Here we are studying several techniques to partition graph.
Keywords: graph partition, spectral, NP-complete, multi-level