Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
SIAM Journal on Matrix Analysis and Applications
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Scientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey
Relaxed Implementation of Spectral Methods for Graph Partitioning
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
A Monte Carlo Approach for Finding More than One Eigenpair
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Improved Monte Carlo linear solvers through non-diagonal splitting
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
| Hi-index | 0.01 |
Determiningthe Fiedler vector of the Laplacian or adjacency matrices of graphs is the most computationally intensive component of several applications, such as graph partitioning, graph coloring, envelope reduction, and seriation. Often an approximation of the Fiedler vector is sufficient.We discuss issues involved in the use of Monte Carlo techniques for this purpose.