Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Amestoy, P.R., Davis, T.A., Duff, I.S.: An Approximate Minimum Degree Ordering Algorithm. SIAM J. on Matrix Analysis and Appl. 17, 886–905 (1996)
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of Finding Embeddings in a k-Tree. SIAM J. Alg. Discr. Meth. 8, 277–284 (1987)
3. Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, New York (1972)
4. Geoffrion, A.M., Nauss, R.: Parametric and Postoptimality Analysis in Integer Linear Programming. Management Science 23, 453–466 (1977)
5. George, A., Liu, J.W.H.: A Quotient Graph Model for Symmetric Factorization. In: Duff, I.S., Stewart, G.W. (eds.) Sparse Matrix Proceedings, pp. 154–175. SIAM Publications, Philadelphia (1978)