Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems,Theoretical Computer Science,Software
Reference33 articles.
1. B. Aspvall, M. Halldorsson, and F. Manne. A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. Lecture Notes in Computer Science, 1541:332–336, 1998.
2. E. Balas and M. Padberg. Set partitioning: A survey. SIAM Review, 18(4):710–760, 1976.
3. A. J. C. Bik and A. G. Wijshoff. Automatic data structure selection and transformation for sparse matrix computation. IEEE Transactions on Parallel and Distributed Systems, 7(2):109–126, 1996.
4. M. L. Bilderback. Edge cut imbalances produced by graph partitioning algorithms. In Proceedings High Performance Computing Symposium HPC99. San Diego, Apr. 1999.
5. R. Boisvert, R. Pozo, K. Remington, R. Barrett, and J. J. Dongarra. Matrix Market. Version 3.0. At URL http://math.nist.gov/MatrixMarket.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献