Downloads: 103
Survey Paper | Computer Science & Engineering | India | Volume 4 Issue 9, September 2015
A Survey on Graph Partitioning Techniques
Santosh Nage | Girish Potdar [2]
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
How to Cite this Article?
Santosh Nage, Girish Potdar, "A Survey on Graph Partitioning Techniques", International Journal of Science and Research (IJSR), Volume 4 Issue 9, September 2015, pp. 1656-1659, https://www.ijsr.net/get_abstract.php?paper_id=SUB158492
How to Share this Article?
Similar Articles with Keyword 'graph partition'
Downloads: 109
Review Papers, Computer Science & Engineering, India, Volume 4 Issue 3, March 2015
Pages: 2062 - 2066Load Balancing in P2P Networks using Random Walk Algorithm
A. S. Syed Navaz [3] | A. S. Syed Fiaz
Downloads: 113
Survey Paper, Computer Science & Engineering, India, Volume 2 Issue 4, April 2013
Pages: 350 - 353Robust Face-Name for Movie Personality Recognition in Graph Matching Technique
K. Yogitha Sri Lakshmi | K.Subrahmanyam | D. Harika [2]