A parallel graph partitioning algorithm for a message-passing multiprocessor
- 1 December 1987
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 16 (6), 427-449
- https://doi.org/10.1007/bf01388998
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Communication results for parallel sparse Cholesky factorization on a hypercubeParallel Computing, 1989
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessorParallel Computing, 1988
- Sparse Cholesky Factorization on a Local-Memory MultiprocessorSIAM Journal on Scientific and Statistical Computing, 1988
- Message-passing multiprocessor simulatorPublished by Office of Scientific and Technical Information (OSTI) ,1986
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A Survey of Interconnection NetworksComputer, 1981
- Area-efficient graph layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970