A modified noising algorithm for the graph partitioning problem

✍ Scribed by V. Sudhakar; C. Siva Ram Murthy

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 804 KB
• Volume: 22
• Category: Article
• ISSN: 0167-9260
• DOI: 10.1016/s0167-9260(97)00007-2

✦ Synopsis

Many heuristics such as iterative improvement and simulated annealing are available in the literature which try to give a near-optimal solution to the graph partitioning problem. Recently, a new method called the noising method has been proposed for solving combinatorial optimization problems. The noising method has been successfully employed to solve the clique partitioning problem. We extend the method to solve the graph partitioning problem. We also propose a modified noising method (algorithm) for efficient solution of the graph partitioning problem. We ewtluate the performance of our algorithm for solving both the problems, viz., the clique partitioning problem using random graphs and the graph partitioning problem using concurrent VLSI circuit simulation program graphs. We compare our algorithm with the original noising and the simulated annealing algorithms. The results show that our modified noising algorithm compares favourably with the original noising and the simulated annealing algorithms, both in terms of the run time and the quality of the solutions obtained.