Scotch Brand 5.1.10 - Manual (Page 134)

[13] M. R. Garey and D. S. Johnson. Computers and Intractablility: A Guide to
the Theory of NP-completeness . W. H. Freeman, San Francisco, 1979.
[14] G. A. Geist and E. G.-Y. Ng. Task scheduling for parallel sparse Cholesky
factorization. International Journal of Parallel Programming, 18(4):291–314,
1989.
[15] A. George, M. T. Heath, J. W.-H. Liu, and E. G.-Y. Ng. Sparse Cholesky
factorization on a local memory multiprocessor. SIAM Journal on Scientific
and Statistical Computing
, 9:327–340, 1988.
[16] A. George and J. W.-H. Liu. The evolution of the minimum degree ordering
algorithm. SIAM Review, 31:1–19, 1989.
[17] J. A. George and J. W.-H. Liu. Computer solution of large sparse positive
definite systems . Prentice Hall, 1981.
[18] N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer. A comparison of several
bandwidth and profile reduction algorithms. ACM Trans. Math. Software,
2:322–330, 1976.
[19] A. Gupta, G. Karypis, and V. Kumar. Scalable parallel algorithms for sparse
linear systems. In Proc. Stratagem’96, Sophia-Antipolis, pages 97–110. INRIA,
July 1996.
[20] A. Gupta, G. Karypis, and V. Kumar. Highly scalable parallel algorithms for
sparse matrix factorization. IEEE Trans. Parallel Distrib. Syst., 8(5):502–520,
1997.
[21] S. W. Hammond. Mapping unstructured grid computations to massively parallel
computers . PhD thesis, Rensselaer Polytechnic Institute, Troy, New-York,
February 1992.
[22] B. Hendrickson and R. Leland. Multidimensional spectral load balancing. Tech-
nical Report SAND93–0074, Sandia National Laboratories, January 1993.
[23] B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs.
Technical Report SAND93–1301, Sandia National Laboratories, June 1993.
[24] B. Hendrickson and R. Leland. The Chaco user’s guide. Technical Report
SAND93–2339, Sandia National Laboratories, November 1993.
[25] B. Hendrickson and R. Leland. The chaco user’s guide – version 2.0. Technical
Report SAND94–2692, Sandia National Laboratories, 1994.
[26] B. Hendrickson and R. Leland. An empirical study of static load balancing
algorithms. In Proc. SHPCC’94, Knoxville, pages 682–685. IEEE, May 1994.
[27] B. Hendrickson, R. Leland, and R. Van Driessche. Skewed graph partitioning.
In Proceedings of the 8 th SIAM Conference on Parallel Processing for Scientific
Computing . IEEE, March 1997.
[28] B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested
dissection ordering. SIAM J. Sci. Comput., 20(2):468–489, 1998.
134