Partitioning Sparse Graphs using the Second Eigenvector of their Graph Laplacian
From MaRDI portal
Publication:6470286
arXivmath/0003036MaRDI QIDQ6470286FDOQ6470286
Authors: David De Wit 
Publication date: 6 March 2000
Abstract: Partitioning a graph into three pieces, with two of them large and connected, and the third a small ``separator set, is useful for improving the performance of a number of combinatorial algorithms. This is done using the second eigenvector of a matrix defined solely in terms of the incidence matrix, called the graph Laplacian. For sparse graphs, the eigenvector can be efficiently computed using the Lanczos algorithm. This graph partitioning algorithm is extended to provide a complete hierarchical subdivision of the graph. The method has been implemented and numerical results obtained both for simple test problems and for several grid graphs.
This page was built for publication: Partitioning Sparse Graphs using the Second Eigenvector of their Graph Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470286)
