Dynamic load balancing with a spectral bisection algorithm for the constrained graph partitioning problem
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 392-397
- https://doi.org/10.1007/bfb0046658
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An improved spectral bisection algorithm and its application to dynamic load balancingParallel Computing, 1995
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A constrained eigenvalue problemLinear Algebra and its Applications, 1989