Multilevel Heuristic Algorithm for Graph Partitioning

  • Raul Baños
  • Consolación Gil
  • Julio Ortega
  • Francisco G. Montoya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2611)


Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc storage of databases, etc. The problem of graph partitioning consists of dividing a graph into a given number of balanced and non-overlapping partitions while the cuts are minimised. Although different algorithms to solve this problem have been proposed, since this is an NP-complete problem, to get more efficient algorithms for increasing complex graphs still remains as an open question. In this paper, we present a new multilevel algorithm including a hybrid heuristic that is applied along the searching process. We also provide experimental results to demonstrate the efficiency of the new algorithm and compare our approach with other previously proposed efficient algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alpert, C.J., and Kahng, A., Recent Developments in Netlist Partitioning: A Survey. Integration: the VLSI Journal, 19/ 1–2 (1995) 1–81.zbMATHCrossRefGoogle Scholar
  2. 2.
    Banerjee, P.: Parallel Algorithms for VLSI Computer Aided Design. Prentice Hall, Englewoods Cliffs, NJ, 1994.Google Scholar
  3. 3.
    Gil, C.; Ortega, J., and Montoya, M.G., Parallel VLSI Test in a Shared Memory Multiprocessors. Concurrency: Practice and Experience, 12/5 (2000) 311–326.CrossRefGoogle Scholar
  4. 4.
    Klenke, R.H., Williams, R.D., and Aylor, J.H., Parallel-Processing Techniques for Automatic Test Pattern Generation, IEEE Computer, (1992) 71–84.Google Scholar
  5. 5.
    Gil, C. and Ortega, J., A Parallel Test Pattern Generator based on Reed-Muller Spectrum, Euromicro Workshop on Parallel and Distributed Processing, IEEE (1997) 199–204.Google Scholar
  6. 6.
    Mobasher, B., Jain, N., Han, E.H., Srivastava J. Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of computer science, University of Minnesota, Minneapolis, 1996.Google Scholar
  7. 7.
    Shekhar S. and DLiu D.R.. Partitioning similarity graphs: A framework for declustering problems.Information Systems Journal, 21/4, (1996)Google Scholar
  8. 8.
    Garey, M.R., and Johnson, D.S, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Company. San Francisco, 1979.Google Scholar
  9. 9.
    Kernighan, B.W., and Lin, S., An Efficient Heuristic Procedure for Partitioning Graphics, The Bell Sys. Tech. Journal, (1970) 291–307.Google Scholar
  10. 10.
    Fiduccia, C., and Mattheyses, R., A Linear Time Heuristic for Improving Network Partitions, In Proc. 19th IEEE Design Automation Conference, (1982) 175–181.Google Scholar
  11. 11.
    Gilbert, J., Miller, G., and Teng, S., Geometric Mesh Partitioning: Implementation and Experiments, In Proceedings of International Parallel Processing Symposium, (1995).Google Scholar
  12. 12.
    Karypis, G. and Kumar V.: Multilevel K-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48/1 (1998) 96–129.CrossRefGoogle Scholar
  13. 13.
    Cong, J., and Smith, M., A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design, In Proc. ACM/IEEE Design Automation Conference, (1993) 755–760.Google Scholar
  14. 14.
    Schloegel, K., Karypis, G.; and Kumar, V., Graph Partitioning for High Performance Scientific Simulations, CRPC Parallel Computing Handbook, Morgan Kaufmann2000.Google Scholar
  15. 15.
    Reeves, C.R., GeneticAlgorithms, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 151–196.Google Scholar
  16. 16.
    Soper, A.J., Walshaw, C., and Cross, M., A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning, Mathematics Research Report 00/IM/58, University of Greenwich, 2000.Google Scholar
  17. 17.
    Gil, C., Ortega, J., Montoya, M.G., and Banos R., A Mixed Heuristic for Circuit Partitioning. Computational Optimization and Applications Journal. 23/3 (2002) 321–340.CrossRefMathSciNetGoogle Scholar
  18. 18.
    Dowsland, K.A, Simulated Annealing, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 20–69.Google Scholar
  19. 19.
    Glover, F., and Laguna, M., Tabu Search, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 70–150.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Raul Baños
    • 1
  • Consolación Gil
    • 1
  • Julio Ortega
    • 2
  • Francisco G. Montoya
    • 3
  1. 1.Dept. Arquitectura de Computadores y ElectrónicaUniversidad de AlmeríaAlmeríaSpain
  2. 2.Dept. Arquitectura y Tecnologia de ComputadoresUniversidad de GranadaGranadaSpain
  3. 3.Dept. Ingenieria CivilUniversidad de GranadaGranadaSpain

Personalised recommendations