Partitioning graphs on message-passing machines by pairwise mincut
References (15)
- et al.
Cluster-partitioning approaches to mapping parallel programs onto a hypercube
Parallel Computing
(1990) Partitioning of unstructured problems for parallel processing
Computing Systems in Engineering
(1991)- et al.
A linear time heuristic for improving network partitions
Load balancing and sparse matrix vector multiplication on the hypercube
Caltech Concurrent Computation Project, Report # 327
(1985)- et al.
A parallel graph partitioning algorithm for message passing computers
International Journal of Parallel Programming
(1987) Mapping unstructured grid computations to massively parallel computers
- et al.
Parallel multilevel k-way partitioning scheme for irregular graphs
There are more references available in the full text version of this article.
Cited by (0)
- 1
Supported in part by an NSF Young Investigator Award CCR-9457768, by an NSF grant CCR-9210422 and by the Louisiana Board of Regents through contract LEQSF(1991-94)-RD-A-09.
Copyright © 1998 Published by Elsevier Inc.