Graph partitioning models for parallel computing
Top Cited Papers
- 1 November 2000
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 26 (12) , 1519-1534
- https://doi.org/10.1016/s0167-8191(00)00048-x
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel ProcessingSIAM Journal on Scientific Computing, 2000
- Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplicationIEEE Transactions on Parallel and Distributed Systems, 1999
- Partitioning sparse rectangular matrices for parallel computations of Ax and A T vPublished by Springer Nature ,1998
- Graph partitioning and parallel solvers: Has the emperor no clothes?Published by Springer Nature ,1998
- Decomposing irregularly sparse matrices for parallel matrix-vector multiplicationPublished by Springer Nature ,1996
- Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratioInternational Journal for Numerical Methods in Engineering, 1995
- A multilevel algorithm for partitioning graphsPublished by Association for Computing Machinery (ACM) ,1995
- A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI designPublished by Association for Computing Machinery (ACM) ,1993
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985