A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM
From MaRDI portal
Publication:5249001
DOI10.1142/S0129054199000162zbMath1320.05122MaRDI QIDQ5249001
Michael Holzrichter, Suely Oliveira
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Super-matrix methods
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- How Good is Recursive Bisection?
- Locality of Reference in LU Decomposition with Partial Pivoting
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS
- A spectral algorithm for envelope reduction of sparse matrices
- Nested Dissection of a Regular Finite Element Mesh
This page was built for publication: A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM
