A conjugate gradient method for the spectral partitioning of graphs

Research output: Contribution to journalArticleAcademic

5 Citations (Scopus)
63 Downloads (Pure)

Abstract

The partitioning of graphs is a frequently occurring problem in science and engineering. The spectral graph partitioning method is a promising heuristic method for this class of problems. Its main disadvantage is the large computing time required to solve a special eigenproblem. Here a simple and efficient method is proposed to reduce this computing time. This method is based on the conjugate gradient minimization method. The convergence properties of the new method are studied for the case of regular one-, two-, and three-dimensional grids. The influence of the aspect ratio of the graph on the convergence rate is also investigated.
Original languageUndefined
Pages (from-to)1493-1502
JournalParallel computing
Volume22
Issue number11
DOIs
Publication statusPublished - 1997

Keywords

  • IR-57232

Cite this