A Graph Based Method for Generating the Fiedler Vector of Irregular Problems

In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and application of the Lanczos method when the graph allows this method to be cheap enough. Our new algorithms are purely spectral. They calculate the Fiedler vector of the original graph and use the information about the problem in the form of a preconditioner for the graph Laplacian. In addition, we use a favorable subspace for starting the Davidson algorithm and reordering of variables for locality of memory references.

• Type: Conference
• Year: 1999
• Where: IPPS
• Authors: Michael Holzrichter, Suely Oliveira
• Keywords: Algorithm, Combinatorial Algorithms, Distributed And Parallel Computing, IPPS 1999, Spectral Graph Partitioning