Graph theory and sparse matrix computation. Proceedings of a workshop that was an integral part of the 1991-92 IMA program on ''Applied linear algebra'', Minneapolis, MN (USA) (Q1310789)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Blair, Jean R. S.; Peyton, Barry}, An introduction to chordal graphs and clique trees, 1-29 [Zbl 0803.68081] \textit{Agrawal, Ajit; Klein, Philip; Ravi, R.}, Cutting down on fill using nested dissection: Provably good elimination orderings, 31-55 [Zbl 0803.68082] \textit{Miller, Gary L.; Teng, Shang-Hua; Thurston, William; Vavasis, Stephen A.}, Automatic mesh partitioning, 57-84 [Zbl 0803.68083] \textit{Eisenstat, Stanley C.; Liu, Joseph W. H.}, Structural representations of Schur complements in sparse matrices, 85-100 [Zbl 0792.05097] \textit{Johnson, Charles R.; Xenophontos, Christos}, Irreducibility and primitivity of Perron complements: Application of the compressed directed graph, 101-106 [Zbl 0792.05099] \textit{Gilbert, John R.; Ng, Esmond G.}, Predicting structure in nonsymmetric sparse matrix factorizations, 107-139 [Zbl 0792.05098] \textit{Alvarado, Fernando L.; Pothen, Alex; Schreiber, Robert}, Highly parallel sparse triangular solution, 141-157 [Zbl 0794.65019] \textit{Ashcraft, Cleve}, The fan-both family of column-based distributed Cholesky factorization algorithms, 159-190 [Zbl 0803.68044] \textit{Schreiber, Robert}, Scalability of sparse direct solvers, 191-209 [Zbl 0796.65025] \textit{Kratzer, Steven G.; Cleary, Andrew J.}, Sparse matrix factorization on SIMD parallel computers, 211-228 [Zbl 0798.65034] \textit{Jones, Mark T.; Plassmann, Paul E.}, The efficient parallel iterative solution of large sparse linear systems, 229-245 [Zbl 0797.65035]