A parallel graph partitioning algorithm for a message-passing multiprocessor
Authors:
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 498-513
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- Message-passing multiprocessor simulator1986
- Parallel pivoting algorithms for sparse symmetric matricesParallel Computing, 1984
- A Survey of Interconnection NetworksComputer, 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefrontInternational Journal for Numerical Methods in Engineering, 1979
- An Automatic Nested Dissection Algorithm for Irregular Finite Element ProblemsSIAM Journal on Numerical Analysis, 1978
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970