%
%
%
% automatically generated
% % bibtex2html-1.02/bin/bibtex2html toWeb-tmp.bib -force -sort year
% Date: Wed Jul 21 11:49:20 2010
% Author: ubora
%
%
%
@ARTICLE{caau:10,
AUTHOR = {Ü. V. Çatalyürek and C. Aykanat and B. Uçar},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {On two-dimensional sparse matrix partitioning: Models,
methods, and a recipe},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {656--683},
VOLUME = {32},
KEYWORDS = {Sparse matrix-vector multiplication,
Hypergraph partitioning, Hypergraph model, Communication cost}
}
@BOOK{brcv:09,
PUBLISHER = {Chapman & Hall/CRC Press},
TITLE = {A Combinatorial Approach to Matrix Theory and its
Applications},
YEAR = {2009},
AUTHOR = {R. A. Brualdi and D. M. Cvetkovic},
ALTEDITOR = {},
ADDRESS = {Boca Raton},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Matrix power, Determinant, Matrix inverse,
Linear system solution}
}
@BOOK{budm:09,
PUBLISHER = {SIAM},
TITLE = {Assignment Problems},
YEAR = {2009},
AUTHOR = {R. Burkard and M. Dell'Amico and S. Martello},
ALTEDITOR = {},
ADDRESS = {Philadelphia, PA, USA},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{mass:09,
AUTHOR = {M. Manguoglu and A. Sameh and O. Schenk},
BOOKTITLE = {In Proc. Euro-Par 2009 Parallel Processing},
TITLE = {PSPIKE: Parallel sparse linear system solver},
YEAR = {2009},
OPTADDRESS = {},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {797--808},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@MISC{biss:09,
AUTHOR = {R. H. Bisseling},
HOWPUBLISHED = {Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061)},
MONTH = {February},
OPTNOTE = {},
TITLE = {Combinatorial problems in high-performance computing},
YEAR = {2009}
}
@MISC{poth:09,
AUTHOR = {A. Pothen},
HOWPUBLISHED = {Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061)},
MONTH = {February},
OPTNOTE = {},
TITLE = {Graph matchings in combinatorial scientific computing
(Vertex-weighted and parallel edge-weighted)},
YEAR = {2009}
}
@PHDTHESIS{agul:08,
AUTHOR = {E. Agullo},
SCHOOL = {Ecole Normale Supérieure de Lyon},
TITLE = {On the out-of-core factorization of large sparse
matrices},
YEAR = {2008},
ADDRESS = {Lyon, France},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{maha:09,
AUTHOR = {M. Halappanavar},
SCHOOL = {Old Dominion University},
TITLE = {Algorithms for Vertex-Weighted Matching in Graphs},
YEAR = {2008},
ADDRESS = {Norfolk, Virginia, USA},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{aggl:08,
AUTHOR = {E. Agullo and A. Guermouche and J.-Y. L'Excellent},
JOURNAL = {Parallel Computing},
TITLE = {A parallel out-of-core multifrontal method: Storage of
factors on disk and analysis of models for an out-of-core active
memory},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6-8},
PAGES = {296--317},
VOLUME = {34},
KEYWORDS = {Out-of-core factorization, Multifrontal method}
}
@ARTICLE{eest:08,
AUTHOR = {M. Elkin and Y. Emek and D. A. Spielman and S.-H. Teng},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Lower-stretch spanning trees},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {608--628},
VOLUME = {38}
}
@ARTICLE{herr:08,
AUTHOR = {P. Hénon and P. Ramet and J. Roman},
JOURNAL = {Parallel Computing},
TITLE = {On finding approximate supernodes for an efficient
block-ILU(k) factorization},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6--8},
PAGES = {345--362},
VOLUME = {34}
}
@ARTICLE{sfny:08,
AUTHOR = {de Sterck, H. and R. D. Falgout and J. W. Nolting and
U. M. Yang},
JOURNAL = {Numerical Linear Algebra with Applications},
TITLE = {Distance-two interpolation for parallel algebraic
multigrid},
YEAR = {2008},
MONTH = {MAR-APR},
OPTNOTE = {},
NUMBER = {2--3},
PAGES = {115--139},
VOLUME = {15}
}
@INPROCEEDINGS{mabi:07,
AUTHOR = {F. Manne and R. H. Bisseling},
BOOKTITLE = {Parallel Processing and Applied Mathematics},
TITLE = {A parallel approximation algorithm for the weighted
maximum matching problem},
YEAR = {2008},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {Roman Wyrzykowski and Konrad Karczewski and
Jack Dongarra and Jerzy Wasniewski},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {708--717},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4967}
}
@INPROCEEDINGS{touc:08,
AUTHOR = {S. Toledo and A. Uchitel},
BOOKTITLE = {7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007),},
TITLE = {A supernodal out-of-core sparse Gaussian-elimination
method},
YEAR = {2008},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {Roman Wyrzykowski and Konrad Karczewski and
Jack Dongarra and Jerzy Wasniewski},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {728--737},
PUBLISHER = {Springer-Verlag Berlin Heidelberg},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4967}
}
@TECHREPORT{resc:08,
AUTHOR = {J. K. Reid and J. A. Scott},
INSTITUTION = {Computational Sciences and Engineering Department, Rutherford Appleton Laboratory},
TITLE = {An efficient out-of-core sparse symmetric indefinite
direct solver},
YEAR = {2008},
ADDRESS = {Oxon, OX11 0QX, England},
MONTH = {December},
OPTNOTE = {},
NUMBER = {RAL-TR-2008-024},
OPTTYPE = {}
}
@MANUAL{pell:08:scotch,
TITLE = {SCOTCH 5.1 User's Guide},
OPTADDRESS = {},
AUTHOR = {F. Pellegrini},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
ORGANIZATION = {Laboratoire Bordelais de Recherche en Informatique (LaBRI)},
YEAR = {2008},
KEYWORDS = {Graph partitioning, Sparse matrix ordering,
Nested dissection}
}
@MISC{duru:08,
AUTHOR = {I. S. Duff and D. Ruiz and B. Uçar},
HOWPUBLISHED = {Presentation at SIAM 13th Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, USA},
MONTH = {March},
OPTNOTE = {},
TITLE = {Computing a class of bipartite matchings in parallel},
YEAR = {2008},
KEYWORDS = {Matching}
}
@PHDTHESIS{kout:07,
AUTHOR = {I. Koutis},
SCHOOL = {Carnegie Mellon University},
TITLE = {Combinatorial and algebraic tools for multigrid
algorithms},
YEAR = {2007},
ADDRESS = {Pittsburgh},
MONTH = {May},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{alol:07,
AUTHOR = {D. M. Alber and L. N. Olson},
JOURNAL = {Numerical Linear Algebra with Applications},
TITLE = {Parallel coarse-grid selection},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {8},
PAGES = {611--643},
VOLUME = {14},
KEYWORDS = {Algebraic multigrid, Preconditioning}
}
@ARTICLE{frfs:07,
AUTHOR = {D. Fritzsche and A. Frommer and D. B. Szyld},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Extensions of certain graph-based algorithms for
preconditioning},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {2144--2161},
VOLUME = {29}
}
@ARTICLE{masa:07,
AUTHOR = {S. Maclachlan and Y. Saad},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A greedy strategy for coarse-grid selection},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1825--1853},
VOLUME = {29}
}
@ARTICLE{ucay:07a,
AUTHOR = {B. Uçar and C. Aykanat},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Partitioning sparse matrices for parallel preconditioned
iterative methods},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1683--1709},
VOLUME = {29},
KEYWORDS = {Sparse matrix-vector multiplication,
Hypergraph partitioning, Hypergraph model, Preconditioning,
Multi-physics simulation, Multi-mesh simulation, Communication cost}
}
@INPROCEEDINGS{aggl:07,
AUTHOR = {E. Agullo and A. Guermouche and J.-Y. L'Excellent},
BOOKTITLE = {High Performance Computing -- HiPC2007; 14th International Conference},
TITLE = {Reducing the I/O volume in an out-of-core sparse
multifrontal solver},
YEAR = {2007},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {S. Aluru and M. Parashar and R. Badrinath and
V. K. Prasanna},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {260--280},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4873},
KEYWORDS = {Out-of-core factorization, Multifrontal method,
Task scheduling, Elimination tree}
}
@INPROCEEDINGS{hepo:07,
AUTHOR = {B. Hendrickson and A. Pothen},
BOOKTITLE = {High Performance Computing for Computational Science---VECPAR 2006},
TITLE = {Combinatorial scientific computing: The enabling power
of discrete algorithms in computational science},
YEAR = {2007},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {M. Dayde and M. L. M. Palma and L. G. A. Coutinho and
E. Pacitti and J. C. Lopes},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {260--280},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4395},
KEYWORDS = {Minimum degree ordering algorithm, Coloring,
Jacobian matrix, Sparse Hessian matrix}
}
@BOOK{brua:06,
PUBLISHER = {Cambridge University Press},
TITLE = {Combinatorial Matrix Classes},
YEAR = {2006},
AUTHOR = {R. A. Brualdi},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Encyclopedia of Mathematics and its Applications},
VOLUME = {108}
}
@BOOK{davi:06,
PUBLISHER = {Society for Industrial and Applied Mathematics},
TITLE = {Direct Methods for Sparse Linear Systems},
YEAR = {2006},
AUTHOR = {T. A. Davis},
ALTEDITOR = {},
ADDRESS = {Philadelphia, PA, USA},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
SERIES = {Fundamentals of Algorithms},
OPTVOLUME = {}
}
@INCOLLECTION{cfht:06,
AUTHOR = {E. Chow and R. D. Falgout and J. J. Hu and
R. S. Tuminaro and U. M. Yang},
BOOKTITLE = {Parallel Processing for Scientific Computing},
PUBLISHER = {SIAM},
TITLE = {A survey of parallelization techniques for multigrid
solvers},
YEAR = {2006},
OPTADDRESS = {},
CHAPTER = {10},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {M. A. Heroux and P. Raghavan and H. D. Simon},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {179--201},
SERIES = {Software, Environments, and Tools},
OPTTYPE = {},
VOLUME = {20}
}
@INCOLLECTION{debk:06,
AUTHOR = {K. D. Devine and E. G. Boman and G. Karypis},
BOOKTITLE = {Frontiers of Scientific Computing},
PUBLISHER = {SIAM},
TITLE = {Partitioning and load balancing for emerging parallel
applications and architectures},
YEAR = {2006},
ADDRESS = {Philadelphia},
OPTCHAPTER = {},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {M. Heroux and A. Raghavan and H. Simon},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{aglp:06,
AUTHOR = {P. R. Amestoy and A. Guermouche and J.-Y. L'Excellent and
S. Pralet},
JOURNAL = {Parallel Computing},
TITLE = {Hybrid scheduling for the parallel solution of linear
systems},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {136--156},
VOLUME = {32}
}
@ARTICLE{bghn:06,
AUTHOR = {M. Bern and J. R. Gilbert and B. Hendrickson and
N. Nguyen and S. Toledo},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Support-graph preconditioners},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {930--951},
VOLUME = {27}
}
@ARTICLE{bosh:06,
AUTHOR = {M. Bollhöfer and O. Schenk},
JOURNAL = {GAMM Mitteilungen},
TITLE = {Combinatorial aspects in sparse elimination methods},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {342--367},
VOLUME = {29}
}
@ARTICLE{gule:06,
AUTHOR = {A. Guermouche and J.-Y. L'Excellent},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {Constructing memory-minimizing schedules for
multifrontal methods},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {17--32},
VOLUME = {32}
}
@ARTICLE{lern:06,
AUTHOR = {I. Lee and P. Raghavan and E. G. Ng},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Effective preconditioning through ordering interleaved
with incomplete factorization},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1069--1088},
VOLUME = {27}
}
@ARTICLE{meit:06,
AUTHOR = {O. Meshar and D. Irony and S. Toledo},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {An out-of-core sparse symmetric-indefinite factorization
method},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {445--471},
VOLUME = {32}
}
@ARTICLE{styh:06,
AUTHOR = {de Sterck, H. and U. M. Yang and J. J. Heys},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Reducing complexity in parallel algebraic multigrid
preconditioners},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1019--1039},
VOLUME = {27}
}
@TECHREPORT{ml-guide:06,
AUTHOR = {M. W. Gee and C. M. Siefert and J. J. Hu and
R. S. Tuminaro and M. G. Sala},
INSTITUTION = {Sandia National Laboratories},
TITLE = {ML 5.0 smoothed aggregation user's guide},
YEAR = {2006},
OPTADDRESS = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {SAND2006-2649},
OPTTYPE = {}
}
@TECHREPORT{resc:06b,
AUTHOR = {J. K. Reid and J. A. Scott},
INSTITUTION = {Computational Sciences and Engineering Department, Rutherford Appleton Laboratory},
TITLE = {An out-of-core sparse Cholesky solver},
YEAR = {2006},
ADDRESS = {Oxon, OX11 0QX, England},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {RAL-TR-2006-013},
OPTTYPE = {}
}
@ARTICLE{bime:06,
AUTHOR = {R. H. Bisseling and W. Meesen},
JOURNAL = {Electronic Transactions on Numerical Analysis},
TITLE = {Communication balancing in parallel sparse matrix-vector
multiplication},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
VOLUME = {21},
KEYWORDS = {Sparse matrix-vector multiplication, Parallel computing,
Bulk synchronous parallel}
}
@ARTICLE{dupr:05,
AUTHOR = {I. S. Duff and S. Pralet},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Strategies for scaling and pivoting for sparse symmetric
indefinite problems},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {313--340},
VOLUME = {27}
}
@ARTICLE{eili:05b,
AUTHOR = {S. C. Eisenstat and J. W. H. Liu},
JOURNAL = {Electronic Transactions on Numerical Analysis},
TITLE = {A tree-based dataflow model for the unsymmetric
multifrontal method},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--19},
VOLUME = {21}
}
@ARTICLE{eili:05,
AUTHOR = {S. C. Eisenstat and J. W. H. Liu},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {The theory of elimination trees for sparse unsymmetric
matrices},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {686--705},
VOLUME = {26}
}
@ARTICLE{gemp:05,
AUTHOR = {A. H. Gebremedhin and F. Manne and A. Pothen},
JOURNAL = {SIAM Review},
TITLE = {What color is your Jacobian? Graph coloring for
computing derivatives},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {629--705},
VOLUME = {47}
}
@ARTICLE{kuhn:05b,
AUTHOR = {H. W. Kuhn},
JOURNAL = {Naval Research Logistics},
TITLE = {Statement for Naval Research Logistics},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {6},
VOLUME = {52}
}
@ARTICLE{kuhn:05,
AUTHOR = {H. W. Kuhn},
JOURNAL = {Naval Research Logistics},
TITLE = {The Hungarian method for the assignment problem},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {7--21},
VOLUME = {52}
}
@ARTICLE{saad:05,
AUTHOR = {Y. Saad},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Multilevel ILU with reorderings for diagonal dominance},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {1032--1057},
VOLUME = {27}
}
@INPROCEEDINGS{bcgm:05,
AUTHOR = {D. Bozdag and Ü. V. Çatalyürek and
A. H. Gebremedhin and F. Manne and E. G. Boman and F. Özgüner},
BOOKTITLE = {Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC-05)},
TITLE = {A parallel distance-2 graph coloring algorithm for
distributed memory computers},
YEAR = {2005},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {L. T. Yang and O. F. Rana and Di Martino, B. and
J. Dongarra},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {796--806},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3726}
}
@TECHREPORT{ifpack-guide,
AUTHOR = {M. Sala and M. Heroux},
INSTITUTION = {Sandia National Laboratories},
TITLE = {Robust algebraic preconditioners with IFPACK 3.0},
YEAR = {2005},
OPTADDRESS = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {SAND-0662},
OPTTYPE = {}
}
@BOOK{biss:04,
PUBLISHER = {Oxford University Press, Oxford, UK},
TITLE = {Parallel Scientific Computation: A Structured Approach
using BSP and MPI},
YEAR = {2004},
AUTHOR = {R. H. Bisseling},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Sparse matrix-vector multiplication,
Fast Fourier Transform, Wavelet, Bulk synchronous parallel,
Parallel computing, Message passing interface}
}
@ARTICLE{amdv:04,
AUTHOR = {P. R. Amestoy and I. S. Duff and C. Vömel},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Task scheduling in an asynchronous distributed memory
multifrontal solver},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {544--565},
VOLUME = {26}
}
@ARTICLE{bchs:04,
AUTHOR = {E. G. Boman and D. Chen and B. Hendrickson and S. Toledo},
JOURNAL = {Numerical Linear Algebra with Applications},
TITLE = {Maximum-weight-basis preconditioners},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {8-9},
PAGES = {695--721},
VOLUME = {11}
}
@ARTICLE{roto:04,
AUTHOR = {V. Rotkin and S. Toledo},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {The design and implementation of a new out-of-core
sparse Cholesky factorization method},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {19--46},
VOLUME = {30}
}
@INPROCEEDINGS{spte:04,
AUTHOR = {D. A. Spielman and S.-H. Teng},
BOOKTITLE = {STOC'04: Proceedings of the 36th annual ACM symposium on Theory of computing},
TITLE = {Nearly-linear time algorithms for graph partitioning,
graph sparsification, and solving linear systems},
YEAR = {2004},
ADDRESS = {New York, NY, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {81--90},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@MISC{ride:04,
AUTHOR = {J. Riedy and J. Demmel},
HOWPUBLISHED = {Presentation at SIAM 11th Conference on Parallel Processing for Scientific Computing (PP04), San Francisco, CA, USA},
MONTH = {February},
OPTNOTE = {},
TITLE = {Parallel weighted bipartite matching and applications},
YEAR = {2004},
KEYWORDS = {Matching}
}
@BOOK{saad:03,
PUBLISHER = {SIAM},
TITLE = {Iterative Methods for Sparse Linear Systems},
YEAR = {2003},
AUTHOR = {Y. Saad},
ALTEDITOR = {},
ADDRESS = {Philadelphia},
EDITION = {2nd},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{bohe:03,
AUTHOR = {E. G. Boman and B. Hendrickson},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Support theory for preconditioning},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {694--717},
VOLUME = {25}
}
@ARTICLE{chto:03,
AUTHOR = {D. Chen and S. Toledo},
JOURNAL = {Electronic Transactions on Numerical Analysis},
TITLE = {Vaidya's preconditioners: Implementation and
experimental study},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {30--49},
VOLUME = {16}
}
@ARTICLE{gulu:03,
AUTHOR = {A. Guermouche and J.-Y. L'Excellent and G. Utard},
JOURNAL = {Parallel Computing},
TITLE = {Impact of reordering on the memory of a multifrontal
solver},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {9},
PAGES = {1191--1218},
VOLUME = {29}
}
@ARTICLE{kixz:03,
AUTHOR = {H. Kim and J. Xu and L. Zikatanov},
JOURNAL = {Numerical Linear Algebra with Applications},
TITLE = {A multigrid method based on graph matching for
convection-diffusion equations},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--2},
PAGES = {181--195},
VOLUME = {10},
KEYWORDS = {Matching, Algebraic multigrid, Preconditioning}
}
@ARTICLE{saad:03b,
AUTHOR = {Y. Saad},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Finding exact and approximate block structures for ILU
preconditioning},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1107--1123},
VOLUME = {24}
}
@INPROCEEDINGS{spte:03,
AUTHOR = {D. A. Spielman and S.-H. Teng},
BOOKTITLE = {44th Annual IEEE Symposium on Foundations of Computer Science},
TITLE = {Solving sparse, symmetric, diagonally dominant linear
systems in time $\mathcal{O}(m^{1.31})$},
YEAR = {2003},
OPTADDRESS = {},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {IEEE},
PAGES = {416--427},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{benz:02,
AUTHOR = {M. Benzi},
JOURNAL = {Journal of Computational Physics},
TITLE = {Preconditioning techniques for large linear systems: A
survey},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {418--477},
VOLUME = {182}
}
@ARTICLE{gupt:02,
AUTHOR = {A. Gupta},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Improved symbolic and numerical factorization algorithms
for unsymmetric sparse matrices},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {529--552},
VOLUME = {24}
}
@ARTICLE{heya:02,
AUTHOR = {V. E. Henson and U. M. Yang},
JOURNAL = {Applied Numerical Mathematics},
TITLE = {BoomerAMG: A parallel algebraic multigrid solver and
preconditioner},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {155--177},
VOLUME = {41}
}
@MANUAL{wals:02:jostle,
TITLE = {The Parallel JOSTLE Library User's Guide, Version 3.0},
ADDRESS = {London, UK},
AUTHOR = {C. Walshaw},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
ORGANIZATION = {University of Greenwich},
YEAR = {2002}
}
@PHDTHESIS{dobr:01,
AUTHOR = {F. Dobrian},
SCHOOL = {Old Dominion University},
TITLE = {External Memory Algorithms for Factoring Sparse Matrices},
YEAR = {2001},
ADDRESS = {Norfolk, Virginia, USA},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{adlk:01,
AUTHOR = {P. R. Amestoy and I. S. Duff and J.-Y. L'Excellent and
J. Koster},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {A fully asynchronous multifrontal solver using
distributed dynamic scheduling},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {15--41},
VOLUME = {23}
}
@ARTICLE{boll:01,
AUTHOR = {M. Bollhöfer},
JOURNAL = {Linear Algebra and its Applications},
TITLE = {A robust ILU with pivoting based on monitoring the
growth of the inverse factors},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--3},
PAGES = {201--218},
VOLUME = {338}
}
@ARTICLE{brta:01,
AUTHOR = {R. Bridson and W.-P. Tang},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A structural diagnosis of some IC orderings},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1527--1532},
VOLUME = {22}
}
@ARTICLE{duko:01,
AUTHOR = {I. S. Duff and J. Koster},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {On algorithms for permuting large entries to the
diagonal of a sparse matrix},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {973--996},
VOLUME = {22}
}
@ARTICLE{hypo:01,
AUTHOR = {D. Hysom and A. Pothen},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A scalable parallel algorithm for incomplete factor
preconditioning},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {2194-2215},
VOLUME = {22}
}
@ARTICLE{schu:01,
AUTHOR = {J. Schulze},
JOURNAL = {BIT Numerical Mathematics},
TITLE = {Towards a tighter coupling of bottom-up and top-down
sparse matrix ordering methods},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {800--841},
VOLUME = {41}
}
@ARTICLE{stub:01,
AUTHOR = {K. Stüben},
JOURNAL = {Journal of Computational and Applied Mathematics},
TITLE = {A review of algebraic multigrid},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--2},
PAGES = {281--309},
VOLUME = {128}
}
@INPROCEEDINGS{caay:01,
AUTHOR = {Ü. V. Çatalyürek and C. Aykanat},
BOOKTITLE = {Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS},
TITLE = {A fine-grain hypergraph model for $2$D decomposition of
sparse matrices},
YEAR = {2001},
ADDRESS = {San Francisco, CA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Sparse matrix-vector multiplication,
Hypergraph partitioning, Hypergraph model, Communication cost}
}
@INPROCEEDINGS{hekp:01,
AUTHOR = {P. Heggernes and S. C. Eisenstat and G. Kumfert and
A. Pothen},
BOOKTITLE = {Proceedings of NIK 2001---14th Norwegian Computer Science Conference},
TITLE = {The computational complexity of the minimum degree
algorithm},
YEAR = {2001},
ADDRESS = {Tromso, Norway},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {98--109},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{varg:00,
PUBLISHER = {Springer, Berlin, Heidelberg, New York},
TITLE = {Matrix Iterative Analysis},
YEAR = {2000},
AUTHOR = {R. S. Varga},
ALTEDITOR = {},
OPTADDRESS = {},
EDITION = {Second},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{amde:00,
AUTHOR = {P. R. Amestoy and I. S. Duff and J.-Y. L'Excellent},
JOURNAL = {Computer methods in applied mechanics and engineering},
TITLE = {Multifrontal parallel distributed symmetric and
unsymmetric solvers},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2--4},
PAGES = {501--520},
VOLUME = {184}
}
@ARTICLE{beht:00,
AUTHOR = {M. Benzi and J. C. Haws and M. Tůma},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Preconditioning highly indefinite and nonsymmetric
matrices},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1333--1353},
VOLUME = {22}
}
@ARTICLE{betu:00,
AUTHOR = {M. Benzi and M. Tůma},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Orderings for factorized sparse approximate inverse
preconditioners},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1851--1868},
VOLUME = {21}
}
@ARTICLE{chow:00,
AUTHOR = {E. Chow},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A priori sparsity patterns for parallel sparse
approximate inverse preconditioners},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1804--1822},
VOLUME = {21}
}
@ARTICLE{heko:00,
AUTHOR = {B. Hendrickson and T. G. Kolda},
JOURNAL = {Parallel Computing},
TITLE = {Graph partitioning models for parallel computing},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {1519--1534},
VOLUME = {26},
KEYWORDS = {Graph algorithms, Graph partitioning,
Hypergraph partitioning, Parallel computing, Communication cost}
}
@INPROCEEDINGS{tuto:00,
AUTHOR = {R. S. Tuminaro and C. Tong},
BOOKTITLE = {Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM)},
TITLE = {Parallel smoothed aggregation multigrid: Aggregation
strategies on massively parallel machines},
YEAR = {2000},
ADDRESS = {Washington, DC, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5},
PUBLISHER = {IEEE Computer Society},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{meur:99,
PUBLISHER = {North-Holland},
TITLE = {Computer Solution of Large Linear Systems},
YEAR = {1999},
AUTHOR = {G. A. Meurant},
ALTEDITOR = {},
ADDRESS = {Amsterdam, Netherlands},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Studies in Mathematics and Its Applications},
VOLUME = {28}
}
@INCOLLECTION{ngpr:99,
AUTHOR = {E. G. Ng and B. W. Peyton and P. Raghavan},
BOOKTITLE = {Iterative methods in scientific computation IV},
PUBLISHER = {IMACS},
TITLE = {A blocked incomplete Cholesky preconditioner for
hierarchical-memory computers},
YEAR = {1999},
ADDRESS = {New Brunswick, NJ, USA},
OPTCHAPTER = {},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {D. R. Kincaid and A. C. Elster},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {211--222},
SERIES = {IMACS Series in Computational Applied Mathematics},
OPTTYPE = {},
VOLUME = {5}
}
@ARTICLE{caay:99,
AUTHOR = {Ü. V. Çatalyürek and C. Aykanat},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Hypergraph-partitioning-based decomposition for parallel
sparse-matrix vector multiplication},
YEAR = {1999},
MONTH = {July},
OPTNOTE = {},
NUMBER = {7},
PAGES = {673--693},
VOLUME = {10},
KEYWORDS = {Sparse matrix-vector multiplication,
Hypergraph partitioning, Hypergraph model, Communication cost}
}
@ARTICLE{besd:99,
AUTHOR = {M. Benzi and D. B. Szyld and van Duin, A.},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Orderings for incomplete factorization preconditioning
of nonsymmetric problems},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1652--1670},
VOLUME = {20}
}
@ARTICLE{degll:99,
AUTHOR = {J. W. Demmel and S. C. Eisenstat and J. R. Gilbert and
X. S. Li and J. W. H. Liu},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {A supernodal approach to sparse partial pivoting},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {720--755},
VOLUME = {20}
}
@ARTICLE{duko:99,
AUTHOR = {I. S. Duff and J. Koster},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {The design and use of algorithms for permuting large
entries to the diagonal of sparse matrices},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {889--901},
VOLUME = {20}
}
@ARTICLE{duvo:99,
AUTHOR = {I. S. Duff and van der Vorst, H. A.},
JOURNAL = {Parallel Computing},
TITLE = {Developments and trends in the parallel solution of
linear systems},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {13--14},
PAGES = {1931--1970},
VOLUME = {25}
}
@INPROCEEDINGS{gito:99,
AUTHOR = {J. R. Gilbert and S. Toledo},
BOOKTITLE = {9th SIAM Conference on Parallel Processing for Scientific Computing (CDROM)},
TITLE = {High-performance out-of-core sparse LU factorization},
YEAR = {1999},
OPTADDRESS = {},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {p.10},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@MANUAL{caay:99a,
TITLE = {PaToH: A multilevel hypergraph partitioning tool,
Version 3.0},
ADDRESS = {Ankara, 06533 Turkey. PaToH is available at http://bmi.osu.edu/umit/software.htm},
AUTHOR = {Ü. V. Çatalyürek and C. Aykanat},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
ORGANIZATION = {Bilkent University, Department of Computer Engineering},
YEAR = {1999},
KEYWORDS = {Hypergraph partitioning}
}
@ARTICLE{aslu:98,
AUTHOR = {C. Ashcraft and J. W. H. Liu},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Robust ordering of sparse matrices using multisection},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {816--832},
VOLUME = {19},
KEYWORDS = {Sparse matrix ordering, Minimum degree algorithm,
Nested dissection}
}
@ARTICLE{hero:98,
AUTHOR = {B. Hendrickson and E. Rothberg},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Improving the run time and quality of nested dissection
ordering},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {468--489},
VOLUME = {20},
KEYWORDS = {Sparse matrix ordering, Nested dissection,
Minimum degree algorithm, Minimum degree ordering, Graph algorithms,
Graph partitioning}
}
@ARTICLE{reif:98,
AUTHOR = {J. H. Reif},
JOURNAL = {Computers and Mathematics with Applications},
TITLE = {Efficient approximate solution of sparse linear systems},
YEAR = {1998},
MONTH = {November},
OPTNOTE = {},
NUMBER = {9},
PAGES = {37--58},
VOLUME = {36}
}
@MANUAL{kaku:98:metis,
TITLE = {MeTiS: A software package for partitioning unstructured
graphs, partitioning meshes, and computing fill-reducing orderings of
sparse matrices version 4.0},
ADDRESS = {Minneapolis},
AUTHOR = {G. Karypis and V. Kumar},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
ORGANIZATION = {University of Minnesota, Department of Comp. Sci. and Eng., Army HPC Research Center},
YEAR = {1998},
KEYWORDS = {Graph partitioning, Sparse matrix ordering,
Nested dissection}
}
@ARTICLE{aslu:97,
AUTHOR = {C. Ashcraft and J. W. H. Liu},
JOURNAL = {BIT},
TITLE = {Using domain decomposition to find graph bisectors},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {506--534},
VOLUME = {37}
}
@ARTICLE{chsa:97,
AUTHOR = {E. Chow and Y. Saad},
JOURNAL = {Journal of Computational and Applied Mathematics},
TITLE = {Experimental study of ILU preconditioners for indefinite
matrices},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {387--414},
VOLUME = {86}
}
@ARTICLE{dadu:97,
AUTHOR = {T. A. Davis and I. S. Duff},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {An unsymmetric-pattern multifrontal method for sparse LU
factorization},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {140--158},
VOLUME = {18}
}
@ARTICLE{grhu:97,
AUTHOR = {M. J. Grote and T. Huckle},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Parallel preconditioning with sparse approximate
inverses},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {838--853},
VOLUME = {18}
}
@INPROCEEDINGS{kaku:97,
AUTHOR = {G. Karypis and V. Kumar},
BOOKTITLE = {Supercomputing '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM)},
TITLE = {Parallel threshold-based ILU factorization},
YEAR = {1997},
ADDRESS = {New York, NY, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--24},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@TECHREPORT{guat:97,
AUTHOR = {S. Guattery},
INSTITUTION = {Institute for Computer Applications in Science and Engineering, NASA Langley Research Center},
TITLE = {Graph embedding techniques for bounding condition
numbers of incomplete factor preconditioners},
YEAR = {1997},
ADDRESS = {Hampton, Virginia},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {ICASE Report No.97-47},
OPTTYPE = {}
}
@PHDTHESIS{grem:96,
AUTHOR = {K. D. Gremban},
SCHOOL = {School of Computer Science, Carnegie Mellon University},
TITLE = {Combinatorial Preconditioners for Sparse, Symmetric,
Diagonally Dominant Linear Systems},
YEAR = {1996},
ADDRESS = {Pittsburgh, PA, USA},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{josh:96,
AUTHOR = {A. Joshi},
SCHOOL = {Department of Computer Science, University of Illinois Urbana-Champaign},
TITLE = {Topics in Optimization and Sparse Linear Systems},
YEAR = {1996},
ADDRESS = {Urbana, IL, USA},
MONTH = {December},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{amdd:96,
AUTHOR = {P. R. Amestoy and T. A. Davis and I. S. Duff},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {An approximate minimum degree ordering algorithm},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {886--905},
VOLUME = {17},
KEYWORDS = {Sparse matrix ordering, Minimum degree algorithm}
}
@ARTICLE{bemt:96,
AUTHOR = {M. Benzi and C. D. Meyer and M. Tůma},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A sparse approximate inverse preconditioner for the
conjugate gradient method},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1135--1149},
VOLUME = {17}
}
@ARTICLE{olne:96,
AUTHOR = {M. Olschowka and A. Neumaier},
JOURNAL = {Linear Algebra and Its Applications},
TITLE = {A new pivoting strategy for Gaussian elimination},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {131--151},
VOLUME = {240}
}
@TECHREPORT{aslu:96,
AUTHOR = {C. Ashcraft and J. W. H. Liu},
INSTITUTION = {Boeing Computer Services},
TITLE = {A partition improvement algorithm for generalized nested
dissection},
YEAR = {1996},
ADDRESS = {Seattle, WA, USA},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {BCSTECH-94-020},
OPTTYPE = {}
}
@TECHREPORT{gupt:96,
AUTHOR = {A. Gupta},
INSTITUTION = {IBM Research Division, T. J. Watson Research Center},
TITLE = {Fast and effective algorithms for graph partitioning and
sparse matrix ordering},
YEAR = {1996},
ADDRESS = {Yorktown Heights, NY, USA},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {RC 20496 (90799)},
OPTTYPE = {}
}
@ARTICLE{ashc:95,
AUTHOR = {C. Ashcraft},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Compressed graphs and the minimum degree algorithm},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1404--1411},
VOLUME = {16},
KEYWORDS = {Minimum degree algorithm}
}
@ARTICLE{clta:95,
AUTHOR = {S. S. Clift and W.-P. Tang},
JOURNAL = {BIT Numerical Mathematics},
TITLE = {Weighted graph based ordering techniques for
preconditioned conjugate gradient methods},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {30--47},
VOLUME = {35}
}
@INPROCEEDINGS{grmz:95,
AUTHOR = {K. D. Gremban and G. L. Miller and M. Zagha},
BOOKTITLE = {9th International Parallel Processing Symposium},
TITLE = {Performance evaluation of a parallel preconditioner},
YEAR = {1995},
ADDRESS = {Santa Barbara},
OPTCROSSREF = {},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {IEEE},
PAGES = {65--69},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{heli:95,
AUTHOR = {B. Hendrickson and R. Leland},
BOOKTITLE = {Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM)},
TITLE = {A multilevel algorithm for partitioning graphs},
YEAR = {1995},
ADDRESS = {New York, NY, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {28},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@MANUAL{heli:95chaco,
TITLE = {The Chaco user's guide, version 2.0},
ADDRESS = {Alburquerque, NM, 87185},
AUTHOR = {B. Hendrickson and R. Leland},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
ORGANIZATION = {Sandia National Laboratories},
YEAR = {1995},
KEYWORDS = {Graph partitioning, Sparse matrix ordering,
Nested dissection}
}
@BOOK{axel:94,
PUBLISHER = {Cambridge University Press},
TITLE = {Iterative solution methods},
YEAR = {1994},
AUTHOR = {O. Axelsson},
ALTEDITOR = {},
ADDRESS = {Cambridge},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{kggk:94,
PUBLISHER = {The Benjamin/Cummings Publishing Company, Inc.},
TITLE = {Introduction to Parallel Computing: Desing and Analysis
of Algorithms},
YEAR = {1994},
AUTHOR = {V. Kumar and A. Grama and A. Gupta and G. Karypis},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{basi:94,
AUTHOR = {S. Barnard and H. D. Simon},
JOURNAL = {Concurrency: Practice and Experience},
TITLE = {A fast multilevel implementation of recursive spectral
bisection for partitioning unstructured problems},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {101--117},
VOLUME = {6}
}
@ARTICLE{saad:94,
AUTHOR = {Y. Saad},
JOURNAL = {Numerical Linear Algebra with Applications},
TITLE = {ILUT: A dual threshold incomplete LU factorization},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {387--402},
VOLUME = {1}
}
@ARTICLE{bhln:93,
AUTHOR = {M. V. Bhat and W. G. Habashi and J. W. H. Liu and
V. N. Nguyen and M. F. Peeters},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {A note on nested dissection for rectangular grids},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {253--258},
VOLUME = {14}
}
@ARTICLE{gili:93,
AUTHOR = {J. R. Gilbert and J. W. H. Liu},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Elimination structures for unsymmetric sparse $LU$
factors},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {334--352},
VOLUME = {14}
}
@ARTICLE{linp:93,
AUTHOR = {J. W. H. Liu and E. G. Ng and B. W. Peyton},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {On finding supernodes for sparse matrix computations},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {242--252},
VOLUME = {14}
}
@ARTICLE{posu:93,
AUTHOR = {A. Pothen and C. Sun},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A mapping algorithm for parallel sparse Cholesky
factorization},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1253--1257},
VOLUME = {14},
KEYWORDS = {Multifrontal method, Cholesky factorization,
Task scheduling, Proportional mapping}
}
@INPROCEEDINGS{biss93,
AUTHOR = {R. H. Bisseling},
BOOKTITLE = {Parallel Computation},
TITLE = {Parallel Iterative Solution of Sparse Linear Systems on
a Transputer Network},
YEAR = {1993},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {A. E. Fincham and B. Ford},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {253--271},
PUBLISHER = {Oxford University Press, Oxford, UK},
SERIES = {The Institute of Mathematics and its Applications Conference Series. New Series},
VOLUME = {46},
KEYWORDS = {GMRES, Cyclic distribution,
Sparse matrix-vector multiplication, Communication cost}
}
@INPROCEEDINGS{bujo:93,
AUTHOR = {T. N. Bui and C. Jones},
BOOKTITLE = {6th SIAM Conference on Parallel Processing for Scientific Computing},
TITLE = {A heuristic for reducing fill-in in sparse matrix
factorization},
YEAR = {1993},
ADDRESS = {Norfolk, Virginia, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {445--452},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Graph partitioning, Multilevel algorithm}
}
@BOOK{mami:92,
PUBLISHER = {Dover},
TITLE = {A Survey of Matrix Theory and Matrix Inequalities},
YEAR = {1992},
AUTHOR = {M. Marcus and H. Minc},
ALTEDITOR = {},
ADDRESS = {(Unabridged, unaltered republication of the corrected (1969) printing of the work published by Prindle, Weber, & Schmidt, Boston, 1964)},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{brua:92,
AUTHOR = {R. A. Brualdi},
JOURNAL = {Linear Algebra and its Applications},
TITLE = {The symbiotic relationship of combinatorics and matrix
theory},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {65--105},
VOLUME = {162--164}
}
@ARTICLE{azft:92,
AUTHOR = {E. F. D'Azevedo and P. A. Forsyth and W.-P. Tang},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Ordering methods for preconditioned conjugate gradient
methods applied to unstructured grid problems},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {944--961},
VOLUME = {13}
}
@ARTICLE{azft:92b,
AUTHOR = {E. F. D'Azevedo and P. A. Forsyth and W.-P. Tang},
JOURNAL = {BIT Numerical Mathematics},
TITLE = {Towards a cost-effective ILU preconditioner with high
level fill},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {442--463},
VOLUME = {32}
}
@ARTICLE{gims:92,
AUTHOR = {J. R. Gilbert and C. Moler and R. Schreiber},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Sparse matrices in MATLAB: Design and implementation},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {333--356},
VOLUME = {13}
}
@ARTICLE{gisc:92,
AUTHOR = {J. R. Gilbert and R. Schreiber},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {Highly parallel sparse Cholesky factorization},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1151--1172},
VOLUME = {13}
}
@ARTICLE{gree:92,
AUTHOR = {R. Greenlaw},
JOURNAL = {Information and Computation},
TITLE = {A model classifying algorithms as inherently sequential
with applications to graph searching},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {133--149},
VOLUME = {97}
}
@ARTICLE{liu:92,
AUTHOR = {J. W. H. Liu},
JOURNAL = {SIAM Review},
TITLE = {The multifrontal method for sparse matrix solution:
Theory and practice},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {82--109},
VOLUME = {34}
}
@BOOK{brry:91,
PUBLISHER = {Cambridge University Press},
TITLE = {Combinatorial Matrix Theory},
YEAR = {1991},
AUTHOR = {R. A. Brualdi and H. J. Ryser},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Encyclopedia of Mathematics and its Applications},
VOLUME = {39}
}
@ARTICLE{abmp:91,
AUTHOR = {H. Alt and N. Blum and K. Mehlhorn and M. Paul},
JOURNAL = {Information Processing Letters},
TITLE = {Computing a maximum cardinality matching in a bipartite
graph in time $\mathcal{O}(n^{1.5}\sqrt{m/\log n})$},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {237--240},
VOLUME = {37},
KEYWORDS = {Matching}
}
@ARTICLE{henp:91,
AUTHOR = {M. T. Heath and E. Ng and B. W. Peyton},
JOURNAL = {SIAM Review},
TITLE = {Parallel algorithms for sparse linear systems},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {420--460},
VOLUME = {33}
}
@UNPUBLISHED{vaid:91,
AUTHOR = {P. M. Vaidya},
NOTE = {Unpublished manuscript presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation},
TITLE = {Solving linear equations with symmetric diagonally
dominant matrices by constructing good preconditioners},
MONTH = {October},
YEAR = {1991}
}
@BOOK{colr:90,
PUBLISHER = {MIT Press},
TITLE = {Introduction to Algorithms},
YEAR = {1990},
AUTHOR = {T. H. Cormen and C. E. Leiserson and R. L. Rivest},
ALTEDITOR = {},
OPTADDRESS = {},
EDITION = {First},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{dddh:90,
AUTHOR = {J. J. Dongarra and Du Croz, J. and I. S. Duff and
S. Hammarling},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {A set of level 3 Basic Linear Algebra Subprograms.},
YEAR = {1990},
OPTMONTH = {},
NOTE = {http://www.netlib.org/blas/blas3-paper.ps},
OPTNUMBER = {},
PAGES = {1--17},
VOLUME = {16},
KEYWORDS = {BLAS, Linear algebra}
}
@ARTICLE{liu:90,
AUTHOR = {J. W. H. Liu},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {The role of elimination trees in sparse factorization},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {134--172},
VOLUME = {11},
KEYWORDS = {Elimination tree, Cholesky factorization,
Sparse matrix ordering, Symbolic factorization}
}
@ARTICLE{onsz:90,
AUTHOR = {J. O'Neil and D. B. Szyld},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {A block ordering method for sparse matrices},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {811--823},
VOLUME = {11}
}
@ARTICLE{pofa:90,
AUTHOR = {A. Pothen and C.-J. Fan},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {Computing the block triangular form of a sparse matrix},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {303--324},
VOLUME = {16}
}
@ARTICLE{posl:90,
AUTHOR = {A. Pothen and H. D. Simon and K.-P. Liou},
JOURNAL = {SIAM Journal on Matrix Analysis and Applications},
TITLE = {Partitioning sparse matrices with eigenvectors of graphs},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {430--452},
VOLUME = {11}
}
@ARTICLE{asgr:89,
AUTHOR = {C. Ashcraft and R. Grimes},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {The influence of relaxed supernode partitions on the
multifrontal method},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {291--309},
VOLUME = {15},
KEYWORDS = {Multifrontal method, Supernode, Fundamental supernode,
Relaxed supernode}
}
@ARTICLE{dume:89,
AUTHOR = {I. S. Duff and G. A. Meurant},
JOURNAL = {BIT},
TITLE = {The effect of ordering on preconditioned conjugate
gradients},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {635--657},
VOLUME = {29}
}
@ARTICLE{geng:89,
AUTHOR = {G. A. Geist and E. G. Ng},
JOURNAL = {International Journal of Parallel Programming},
TITLE = {Task scheduling for parallel sparse Cholesky
factorization},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {291--314},
VOLUME = {18},
KEYWORDS = {Parallel computing, Cholesky factorization,
Task scheduling, Subtree-to-subcube mapping}
}
@ARTICLE{geli:89,
AUTHOR = {A. George and J. W. H. Liu},
JOURNAL = {SIAM Review},
TITLE = {The evolution of the minimum degree ordering algorithm},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--19},
VOLUME = {31},
KEYWORDS = {Sparse matrix ordering, Minimum degree algorithm,
Computational complexity}
}
@ARTICLE{geln:88,
AUTHOR = {A. George and J. W. H. Liu and E. Ng},
JOURNAL = {Parallel Computing},
TITLE = {Communication results for parallel sparse Cholesky
factorization on a hypercube},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {287--298},
VOLUME = {10},
KEYWORDS = {Parallel computing, Cholesky factorization,
Task scheduling, Subtree-to-subcube mapping}
}
@ARTICLE{liu:89,
AUTHOR = {J. W. H. Liu},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {The minimum degree ordering with constraints},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {1136--1145},
VOLUME = {10},
KEYWORDS = {Minimum degree ordering}
}
@ARTICLE{degr:88,
AUTHOR = {I. S. Duff and A. M. Erisman and C. W. Gear and
J. K. Reid},
JOURNAL = {SIGNUM Newsletter},
TITLE = {Sparsity structure and Gaussian elimination},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2--8},
VOLUME = {23}
}
@ARTICLE{gipe:88,
AUTHOR = {J. R. Gilbert and T. Peierls},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {Sparse partial pivoting in time proportional to
arithmetic operations},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {862--874},
VOLUME = {9}
}
@ARTICLE{liu:88,
AUTHOR = {J. W. H. Liu},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {Equivalent sparse matrix reordering by elimination tree
rotations},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {424--444},
VOLUME = {9},
KEYWORDS = {Multifrontal method, Elimination tree,
Equivalent reordering, Out-of-core factorization,
Cholesky factorization}
}
@INCOLLECTION{rust:87,
AUTHOR = {J. W. Ruge and K. Stüben},
BOOKTITLE = {Multigrid Methods},
PUBLISHER = {SIAM},
TITLE = {Algebraic multigrid},
YEAR = {1987},
ADDRESS = {Philadelphia, Pennsylvania},
CHAPTER = {4},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {S. F. McCormick},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {73--130},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{feta:87,
AUTHOR = {M. L. Fredman and R. E. Tarjan},
JOURNAL = {J. ACM},
TITLE = {Fibonacci heaps and their uses in improved network
optimization algorithms},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {596--615},
VOLUME = {34}
}
@ARTICLE{gita:87,
AUTHOR = {J. R. Gilbert and R. E. Tarjan},
JOURNAL = {Numerische Mathematik},
TITLE = {The analysis of a nested dissection algorithm},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {377--404},
VOLUME = {50}
}
@BOOK{duer:86,
PUBLISHER = {Oxford University Press},
TITLE = {Direct Methods for Sparse Matrices},
YEAR = {1986},
AUTHOR = {I. S. Duff and A. M. Erisman and J. K. Reid},
ALTEDITOR = {},
ADDRESS = {London},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{lopl:86,
PUBLISHER = {Elsevier Science Publishers},
TITLE = {Matching Theory},
YEAR = {1986},
AUTHOR = {L. Lovasz and M. D. Plummer},
ALTEDITOR = {},
ADDRESS = {Amsterdam, Netherlands},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {North-Holland mathematics studies},
OPTVOLUME = {}
}
@ARTICLE{liu:86b,
AUTHOR = {J. W. H. Liu},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {A compact row storage scheme for Cholesky factors using
elimination trees},
YEAR = {1986},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {127--148},
VOLUME = {12}
}
@ARTICLE{liu:86,
AUTHOR = {J. W. H. Liu},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {On the storage requirement in the out-of-core
multifrontal method for sparse factorization},
YEAR = {1986},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {249--264},
VOLUME = {12}
}
@ARTICLE{luby:86,
AUTHOR = {M. Luby},
JOURNAL = {SIAM Journal on Computing},
TITLE = {A simple parallel algorithm for the maximal independent
set problem},
YEAR = {1986},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1036--1053},
VOLUME = {15},
KEYWORDS = {Maximal independent set}
}
@ARTICLE{liu:85,
AUTHOR = {J. W. H. Liu},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {Modification of the minimum-degree algorithm by multiple
elimination},
YEAR = {1985},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {141--153},
VOLUME = {11}
}
@ARTICLE{reif:85,
AUTHOR = {J. H. Reif},
JOURNAL = {Information Processing Letters},
TITLE = {Depth-first search is inherently sequential},
YEAR = {1985},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {229--234},
VOLUME = {20}
}
@INPROCEEDINGS{simo:85,
AUTHOR = {H. D. Simon},
BOOKTITLE = {Proceedings of the 1985 Reservoir Simulation Symposium},
TITLE = {Incomplete LU preconditioners for
conjugate-gradient-type iterative methods},
YEAR = {1985},
ADDRESS = {Dallas},
OPTCROSSREF = {},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {387--396},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@PHDTHESIS{po:phd,
AUTHOR = {A. Pothen},
SCHOOL = {Department of Computer Science, Cornell University, Ithaca, New York},
TITLE = {Sparse Null Bases and Marriage Theorems},
YEAR = {1984},
OPTADDRESS = {},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{dure:84,
AUTHOR = {I. S. Duff and J. K. Reid},
JOURNAL = {SIAM Journal on Scientific and Statistical Computing},
TITLE = {The multifrontal solution of unsymmetric sets of linear
equations},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {633--641},
VOLUME = {5}
}
@ARTICLE{rose:84,
AUTHOR = {D. J. Rose},
JOURNAL = {SIAM Journal on Algebraic and Discrete Methods},
TITLE = {Convergent regular splittings for singular $M$-matrices},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {133--144},
VOLUME = {5}
}
@BOOK{tarj:83,
PUBLISHER = {SIAM},
TITLE = {Data Structures and Network Algorithms},
YEAR = {1983},
AUTHOR = {R. E. Tarjan},
ALTEDITOR = {},
ADDRESS = {Philadelphia, PA, USA},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {CBMS-NSF Regional Conference Series in Applied Mathematics},
VOLUME = {44}
}
@ARTICLE{dure:83b,
AUTHOR = {I. S. Duff and J. K. Reid},
JOURNAL = {IMA Journal on Numerical Analysis},
TITLE = {A note on the work involved in no-fill sparse matrix
factorization},
YEAR = {1983},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {37-40},
VOLUME = {1}
}
@ARTICLE{dure:83,
AUTHOR = {I. S. Duff and J. K. Reid},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {The multifrontal solution of indefinite sparse symmetric
linear equations},
YEAR = {1983},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {302--325},
VOLUME = {9}
}
@ARTICLE{egss:82,
AUTHOR = {S. C. Eisenstat and M. C. Gursky and M. H. Schultz and
A. H. Sherman},
JOURNAL = {International Journal for Numerical Methods in Engineering},
TITLE = {The Yale sparse matrix package I: The symmetric codes},
YEAR = {1982},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1145--1151},
VOLUME = {18}
}
@ARTICLE{jeke:82,
AUTHOR = {J. A. G. Jess and H. G. M. Kees},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {A data structure for parallel L/U decomposition},
YEAR = {1982},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {231--239},
VOLUME = {31}
}
@ARTICLE{schr:82,
AUTHOR = {R. Schreiber},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {A new implementation of sparse Gaussian elimination},
YEAR = {1982},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {256--276},
VOLUME = {8}
}
@INPROCEEDINGS{duff:81,
AUTHOR = {I. S. Duff},
BOOKTITLE = {Proceedings of 1981 Dundee Biennal Conference on Numerical Analysis},
TITLE = {Full matrix techniques in sparse Gaussian elimination},
YEAR = {1982},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {G. A. Watson},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {71--84},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Mathematics},
VOLUME = {912}
}
@INPROCEEDINGS{fima:82,
AUTHOR = {C. M. Fiduccia and R. M. Mattheyses},
BOOKTITLE = {DAC '82: Proceedings of the 19th Conference on Design Automation},
TITLE = {A linear-time heuristic for improving network partitions},
YEAR = {1982},
ADDRESS = {Piscataway, NJ, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {175--181},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {}
}
@TECHREPORT{dure:ma27:82,
AUTHOR = {I. S. Duff and J. K. Reid},
INSTITUTION = {HMSO},
TITLE = {MA27--A set of Fortran subroutines for solving sparse
symmetric sets of linear equations},
YEAR = {1982},
ADDRESS = {London, UK},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {AERE R10533},
OPTTYPE = {}
}
@BOOK{geli:81,
PUBLISHER = {Prentice-Hall},
TITLE = {Computer Solution of Large Sparse Positive Definite
Systems},
YEAR = {1981},
AUTHOR = {A. George and J. W. H. Liu},
ALTEDITOR = {},
ADDRESS = {Englewood Cliffs, N.J.},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{duff:81d,
AUTHOR = {I. S. Duff},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {Algorithm 575: Permutations for a zero-free diagonal},
YEAR = {1981},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {387--390},
VOLUME = {7}
}
@ARTICLE{duff:81c,
AUTHOR = {I. S. Duff},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {On algorithms for obtaining a maximum transversal},
YEAR = {1981},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {315--330},
VOLUME = {7}
}
@ARTICLE{yann:81,
AUTHOR = {M. Yannakakis},
JOURNAL = {SIAM Journal on Algebraic and Discrete Methods},
TITLE = {Computing the minimum fill-in is NP-complete},
YEAR = {1981},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {77--79},
VOLUME = {2}
}
@ARTICLE{geor:80,
AUTHOR = {A. George},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {An automatic one-way dissection algorithm for irregular
finite element problems},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {740--751},
VOLUME = {17}
}
@ARTICLE{geli:80,
AUTHOR = {A. George and J. W. H. Liu},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {A fast implementation of the minimum degree algorithm
using quotient graphs},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {337--358},
VOLUME = {6}
}
@ARTICLE{geli:80b,
AUTHOR = {A. George and J. W. H. Liu},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {A minimal storage implementation of the minimum degree
algorithm},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {282--299},
VOLUME = {17}
}
@ARTICLE{gilb:80,
AUTHOR = {J. R. Gilbert},
JOURNAL = {SIAM Journal on Algebraic and Discrete Methods},
TITLE = {A note on the NP-completeness of vertex elimination on
directed graphs},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {292--294},
VOLUME = {1}
}
@ARTICLE{lirt:79,
AUTHOR = {R. J. Lipton and D. J. Rose and R. E. Tarjan},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {Generalized nested dissection},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {346--358},
VOLUME = {16}
}
@ARTICLE{lita:79,
AUTHOR = {R. J. Lipton and R. E. Tarjan},
JOURNAL = {SIAM Journal on Applied Mathematics},
TITLE = {A separator theorem for planar graphs},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {177-189},
VOLUME = {36}
}
@ARTICLE{dure:78b,
AUTHOR = {I. S. Duff and J. K. Reid},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {Algorithm 529: Permutations to block triangular form},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {189--192},
VOLUME = {4}
}
@ARTICLE{dure:78a,
AUTHOR = {I. S. Duff and J. K. Reid},
JOURNAL = {ACM Transactions on Mathematical Software},
TITLE = {An implementation of Tarjan's algorithm for the block
triangularization of a matrix},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {137--147},
VOLUME = {4}
}
@ARTICLE{geli:78,
AUTHOR = {A. George and J. W. H. Liu},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {An automatic nested dissection algorithm for irregular
finite element problems},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {1053--1069},
VOLUME = {15}
}
@ARTICLE{gemc:78,
AUTHOR = {A. George and D. R. McIntyre},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {On the application of the minimum degree algorithm to
finite element systems},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {90--112},
VOLUME = {15}
}
@ARTICLE{gepv:78,
AUTHOR = {A. George and W. G. Poole and R. G. Voigt},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {Incomplete nested dissection for solving $n$ by $n$ grid
problems},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {662--673},
VOLUME = {15}
}
@ARTICLE{gust:78,
AUTHOR = {I. Gustafsson},
JOURNAL = {BIT Numerical Mathematics},
TITLE = {A class of first order factorization methods},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {142--156},
VOLUME = {18}
}
@ARTICLE{rota:78,
AUTHOR = {D. J. Rose and R. E. Tarjan},
JOURNAL = {SIAM Journal on Applied Mathematics},
TITLE = {Algorithmic aspects of vertex elimination in directed
graphs},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {176--197},
VOLUME = {34}
}
@TECHREPORT{spee:78,
AUTHOR = {B. Speelpenning},
INSTITUTION = {Department of Computer Science, University of Illinois at Urbana-Champaign, Illinois},
TITLE = {The generalized element method},
YEAR = {1978},
OPTADDRESS = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {UIUCDCS-R-78-946},
OPTTYPE = {}
}
@ARTICLE{duff:77,
AUTHOR = {I. S. Duff},
JOURNAL = {Journal of the Institute of Mathematics and its Applications},
TITLE = {On permutations to block triangular form},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {339--342},
VOLUME = {19}
}
@ARTICLE{mevo:77,
AUTHOR = {J. A. Meijerink and van der Vorst, H. A.},
JOURNAL = {Mathematics of Computation},
TITLE = {An iterative solution method for linear systems of which
the coefficient matrix is a symmetric $M$-matrix},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {137},
PAGES = {148--162},
VOLUME = {31}
}
@INCOLLECTION{gust:76,
AUTHOR = {F. G. Gustavson},
BOOKTITLE = {Sparse Matrix Computations},
PUBLISHER = {Academic Press},
TITLE = {Finding the block lower-triangular form of a sparse
matrix},
YEAR = {1976},
ADDRESS = {New York and London},
OPTCHAPTER = {},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {J. R. Bunch and D. J. Rose},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {275--289},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{duer:76,
AUTHOR = {I. S. Duff and A. M. Erisman and J. K. Reid},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {On George's nested dissection method},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {686--695},
VOLUME = {13}
}
@ARTICLE{gips:76,
AUTHOR = {N. E. Gibbs and W. G. Poole and P. K. Stockmeyer},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {An algorithm for reducing the bandwidth and profile of a
sparse matrix},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {236-250},
VOLUME = {13}
}
@ARTICLE{lish:76,
AUTHOR = {W.-H. Liu and A. H. Sherman},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {Comparative analysis of the Cuthill-McKee and the
Reverse Cuthill--McKee ordering algorithms for sparse matrices},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {198-213},
VOLUME = {13}
}
@ARTICLE{rotl:76,
AUTHOR = {D. J. Rose and R. E. Tarjan and G. S. Lueker},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Algorithmic aspects of vertex elimination on graphs},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {266--283},
VOLUME = {5}
}
@INCOLLECTION{will:75,
AUTHOR = {R. A. Willoughby},
BOOKTITLE = {Numerische Methoden bei Graphentheoretischen und Kombinatorischen Problemen},
PUBLISHER = {Birkhäuser Verlag},
TITLE = {A characterization of matrix irreducibility},
YEAR = {1975},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {L. Collatz and G. Meinardus and H. Werner},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {131--143},
SERIES = {International Series of Numerical Mathematics},
OPTTYPE = {},
VOLUME = {29}
}
@ARTICLE{geor:74,
AUTHOR = {A. George},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {On block elimination for sparse linear systems},
YEAR = {1974},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {585--603},
VOLUME = {11}
}
@INPROCEEDINGS{rowh:74,
AUTHOR = {D. J. Rose and G. F. Whitten},
BOOKTITLE = {ACM 74: Proceedings of the 1974 annual conference},
TITLE = {Automatic nested dissection},
YEAR = {1974},
ADDRESS = {New York, NY, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {82--88},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{geor:73,
AUTHOR = {A. George},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {Nested dissection of a regular finite element mesh},
YEAR = {1973},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {345--363},
VOLUME = {10}
}
@ARTICLE{homr:73,
AUTHOR = {A. J. Hoffman and M. S. Martin and D. J. Rose},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {Complexity bounds for regular finite difference and
finite element grids},
YEAR = {1973},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {364--369},
VOLUME = {10}
}
@ARTICLE{hoka:73,
AUTHOR = {J. E. Hopcroft and R. M. Karp},
JOURNAL = {SIAM Journal on Computing},
TITLE = {An $n^{5/2}$ algorithm for maximum matchings in
bipartite graphs},
YEAR = {1973},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {225--231},
VOLUME = {2},
KEYWORDS = {Matching}
}
@PHDTHESIS{duff:72,
AUTHOR = {I. S. Duff},
SCHOOL = {Oxford University},
TITLE = {Analysis of Sparse Systems},
YEAR = {1972},
ADDRESS = {England},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@INCOLLECTION{rose:72,
AUTHOR = {D. J. Rose},
BOOKTITLE = {Graph Theory and Computing},
PUBLISHER = {Academic Press},
TITLE = {A graph-theoretic study of the numerical solution of
sparse positive definite systems of linear equations},
YEAR = {1972},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTCROSSREF = {},
OPTEDITION = {},
EDITOR = {R. C. Read},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {183--217},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEYWORDS = {Minimum degree algorithm}
}
@ARTICLE{tarj:72,
AUTHOR = {R. E. Tarjan},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Depth-first search and linear graph algorithms},
YEAR = {1972},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {146--160},
VOLUME = {1}
}
@PHDTHESIS{geor:71,
AUTHOR = {A. J. George},
SCHOOL = {Stanford University},
TITLE = {Computer Implementation of the Finite Element Method},
YEAR = {1971},
ADDRESS = {Stanford, CA, USA},
OPTMONTH = {},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{iron:70,
AUTHOR = {B. M. Irons},
JOURNAL = {International Journal for Numerical Methods in Engineering},
TITLE = {A frontal solution program for finite-element analysis},
YEAR = {1970},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {5--32},
VOLUME = {2}
}
@ARTICLE{keli:70,
AUTHOR = {B. W. Kernighan and S. Lin},
JOURNAL = {The Bell System Technical Journal},
TITLE = {An efficient heuristic procedure for partitioning graphs},
YEAR = {1970},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {291--307},
VOLUME = {49}
}
@ARTICLE{rose:70,
AUTHOR = {D. J. Rose},
JOURNAL = {Journal of Mathematical Analysis and Applications},
TITLE = {Triangulated graphs and the elimination process},
YEAR = {1970},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {597--609},
VOLUME = {32},
KEYWORDS = {Elimination process, Triangulated graph}
}
@INPROCEEDINGS{cumc:69,
AUTHOR = {E. Cuthill and J. McKee},
BOOKTITLE = {Proceedings of the 24th national conference},
TITLE = {Reducing the bandwidth of sparse symmetric matrices},
YEAR = {1969},
ADDRESS = {New York, NY, USA},
OPTCROSSREF = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {157--172},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@ARTICLE{tiwa:67,
AUTHOR = {W. F. Tinney and J. W. Walker},
JOURNAL = {Proceedings of the IEEE},
TITLE = {Direct solutions of sparse network equations by
optimally ordered triangular factorization},
YEAR = {1967},
MONTH = {Nov.},
OPTNOTE = {},
NUMBER = {11},
PAGES = {1801--1809},
VOLUME = {55},
KEYWORDS = {Minimum degree algorithm}
}
@ARTICLE{dume:63b,
AUTHOR = {A. L. Dulmage and N. S. Mendelsohn},
JOURNAL = {SIAM Journal on Applied Mathematics},
TITLE = {Remarks on solutions of the optimal assignment problem},
YEAR = {1963},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1103--1109},
VOLUME = {11}
}
@ARTICLE{dume:63a,
AUTHOR = {A. L. Dulmage and N. S. Mendelsohn},
JOURNAL = {SIAM Journal on Applied Mathematics},
TITLE = {Two algorithms for bipartite graphs},
YEAR = {1963},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {183--194},
VOLUME = {11}
}
@ARTICLE{part:61,
AUTHOR = {S. Parter},
JOURNAL = {SIAM Review},
TITLE = {The use of linear graphs in Gauss elimination},
YEAR = {1961},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {119--130},
VOLUME = {3},
KEYWORDS = {Elimination process}
}
@ARTICLE{dume:59,
AUTHOR = {A. L. Dulmage and N. S. Mendelsohn},
JOURNAL = {Trans. Roy. Soc. Can. Sec. III},
TITLE = {A structure theory of bipartite graphs of finite
exterior dimension},
YEAR = {1959},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--13},
VOLUME = {53}
}
@ARTICLE{dume:58,
AUTHOR = {A. L. Dulmage and N. S. Mendelsohn},
JOURNAL = {Canadian Journal of Mathematics},
TITLE = {Coverings of bipartite graphs},
YEAR = {1958},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {517--534},
VOLUME = {10}
}
@ARTICLE{berg:57,
AUTHOR = {C. Berge},
JOURNAL = {Proceedings of the National Academy of Sciences of the USA},
TITLE = {Two theorems in graph theory},
YEAR = {1957},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {842--844},
VOLUME = {43},
KEYWORDS = {Matching, Alternating path, Augmenting path,
Vertex cover}
}
@ARTICLE{mark:57,
AUTHOR = {H. M. Markowitz},
JOURNAL = {Management Science},
TITLE = {The elimination form of the inverse and its application
to linear programming},
YEAR = {1957},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {255--269},
VOLUME = {3}
}
@ARTICLE{hall:56,
AUTHOR = {Hall, Jr., M.},
JOURNAL = {The American Mathematical Monthly},
TITLE = {An algorithm for distinct representatives},
YEAR = {1956},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {10},
PAGES = {716--717},
VOLUME = {63}
}
@ARTICLE{kuhn:55,
AUTHOR = {H. W. Kuhn},
JOURNAL = {Naval Research Logistics Quarterly},
TITLE = {The Hungarian method for the assignment problem},
YEAR = {1955},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--2},
PAGES = {83--97},
VOLUME = {2}
}
@ARTICLE{hall:35,
AUTHOR = {P. Hall},
JOURNAL = {Journal of the London Mathematical Society},
TITLE = {On representatives of subsets},
YEAR = {1935},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {37},
PAGES = {26--30},
VOLUME = {s1-10}
}