PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*

@article{Liou1973PARTITIONINGSM,
  title={PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*},
  author={KANG-PU Liou and A. Pothen},
  journal={Ibm Journal of Research and Development},
  year={1973}
}
  • KANG-PU Liou, A. Pothen
  • Published 1973
  • Mathematics, Computer Science
  • Ibm Journal of Research and Development
  • The problem ofcomputing a small vertex separator in a graph arises in the context ofcomputing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the… CONTINUE READING
    1,769 Citations
    Partitioning Sparse Graphs using the Second Eigenvector of their Graph Laplacian
    • 2
    • Highly Influenced
    • PDF
    On the performance of spectral graph partitioning methods
    • 77
    • PDF
    Embedded in the Shadow of the Separator
    • 40
    • PDF
    Spectral Partitioning with Multiple Eigenvectors
    • 170
    • PDF
    On the Quality of Spectral Separators
    • 164
    • PDF
    A Graph Based Davidson Algorithm for the Graph Partitioning Problem
    • 10
    • PDF
    Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 2 . 0
    • 58
    • PDF

    References

    SHOWING 1-10 OF 19 REFERENCES
    Lower bounds for the partitioning of graphs
    • 656
    • Highly Influential
    Algebraic Graph Theory: COLOURING PROBLEMS
    • 467
    An efficient heuristic procedure for partitioning graphs
    • 3,533
    A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
    • 1,213
    An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
    • 2,427
    • PDF
    Nested Dissection of a Regular Finite Element Mesh
    • 1,014
    Time Bounds for Selection
    • 1,266
    • PDF
    Modern Error Analysis
    • 136
    "J."
    • 591,889