Partitioning of unstructured problems for parallel processing
- 1 January 1991
- journal article
- Published by Elsevier in Computing Systems in Engineering
- Vol. 2 (2-3), 135-148
- https://doi.org/10.1016/0956-0521(91)90014-v
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Transient finite element computations on 65536 processors: The connection machineInternational Journal for Numerical Methods in Engineering, 1990
- On the mapping of massively parallel processors onto finite element graphsComputers & Structures, 1989
- Graph partitioning by EigenvectorsLinear Algebra and its Applications, 1988
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- On estimating the largest eigenvalue with the Lanczos algorithmMathematics of Computation, 1982
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Eigenvectors of acyclic matricesCzechoslovak Mathematical Journal, 1975
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970