A parallel graph partitioning algorithm for a message-passing multiprocessor
John R. Gilbert, Earl Zmijewski · International Journal of Parallel Programming · 1987
Cited by 89 works. doi:10.1007/bf01388998
Authors
References
- The Design and Analysis of Computer Algorithms
- An Efficient Heuristic Procedure for Partitioning Graphs
- Computer Solution of Large Sparse Positive Definite Systems.
- Algorithmic Aspects of Vertex Elimination on Graphs
- A Survey of Interconnection Networks
- A Linear-Time Heuristic for Improving Network Partitions
- Computer Solution of Large Sparse Positive Definite
- Applications of a Planar Separator Theorem
- Generalized Nested Dissection
- Area-Efficient Graph Layouts (for VLSI).