Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. S. T. Barnard and H. D. Simon. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2):101–117, 1994.
2. R. Diekmann, B. Monien, and R. Preis. Load balancing strategies for distributed memory machines. Technical Report TR-RSFB-97-050, Department of Computer Science, University of Paderborn, 1997.
3. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel graphs. Technical Report SAND 92-1460, Sandia National Lab., USA, 1992.
4. B. Hendrickson and R. Leland. The Chaco user's guide. Technical Report SAND 93-2339, Sandia National Lab., USA, 1993.
5. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report Tech. Rep. SAND 93-11301, Sandia National Lab., USA, 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献