BACK TO INDEX
Publications in year 1991 on CSC


R. A. Brualdi and H. J. Ryser.
Combinatorial Matrix Theory,
volume 39 of Encyclopedia of Mathematics and its Applications.
Cambridge University Press,
1991.
Articles in journal or book chapters


H. Alt,
N. Blum,
K. Mehlhorn,
and M. Paul.
Computing a maximum cardinality matching in a bipartite graph in time $\mathcal{O}(n^{1.5}\sqrt{m/\log n})$.
Information Processing Letters,
37(4):237240,
1991.
Keyword(s): Matching.

M. T. Heath,
E. Ng,
and B. W. Peyton.
Parallel algorithms for sparse linear systems.
SIAM Review,
33(3):420460,
1991.

P. M. Vaidya.
Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners.
Note: Unpublished manuscript presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation,
October 1991.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.