Rate the Article: A Survey on Graph Partitioning Techniques, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 103 | Views: 342

Survey Paper | Computer Science & Engineering | India | Volume 4 Issue 9, September 2015 | Rating: 6.4 / 10


A Survey on Graph Partitioning Techniques

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


Edition: Volume 4 Issue 9, September 2015,


Pages: 1656 - 1659



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top