Tree decompositions and large-scale computation

[1]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[2]  W. F. Tinney,et al.  On computing certain elements of the inverse of a sparse matrix , 1975, Commun. ACM.

[3]  S. Esakkirajan,et al.  Fundamentals of relational database management systems , 2007 .

[4]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[5]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[6]  Endre Rev,et al.  Computing multiple steady states in homogeneous azeotropic and ideal two‐product distillation , 2011 .

[7]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[8]  John P. Moussouris.  Gibbs and Markov random systems with constraints , 1974 .

[9]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Don W. Green,et al.  Perry's chemical engineers' handbook. 7th ed. , 1997 .

[12]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[13]  Jacob Goldberger,et al.  Sequentially finding the N-Best List in Hidden Markov Models , 2001, IJCAI.

[14]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[15]  Nicholas I. M. Gould,et al.  A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations , 2007, TOMS.

[16]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[17]  A. Neumaier,et al.  Restricted maximum likelihood estimation of covariances in sparse linear models , 1998, Genetics Selection Evolution.

[18]  J. Pearl.  Graphical Models, Causality, and Intervention , 2011 .

[19]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[20]  Gautam Mitra,et al.  Hidden Markov models for financial optimization problems , 2010 .

[21]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[22]  Valeria De Fonzo,et al.  Hidden Markov Models in Bioinformatics , 2007 .

[23]  Don W. Green,et al.  Perry's Chemical Engineers' Handbook , 2007 .

[24]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..

[25]  Barry W. Peyton,et al.  On Finding Minimum-Diameter Clique Trees , 1994, Nord. J. Comput..

[26]  Byung-Jun Yoon,et al.  Hidden Markov Models and their Applications in Biological Sequence Analysis , 2009, Current genomics.

[27]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[28]  Katsuki Fujisawa,et al.  Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results , 2003, Math. Program..

[29]  Charles R. Johnson,et al.  Determinantal formulae for matrix completions associated with chordal graphs , 1989 .

[30]  J. W. Walker,et al.  Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .

[31]  Peter Jeavons,et al.  A Survey of Tractable Constraint Satisfaction Problems , 1997 .

[32]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[33]  Barry W. Peyton,et al.  Minimal Orderings Revisited , 1999, SIAM J. Matrix Anal. Appl..

[34]  J. M. Hammersley,et al.  Markov fields on finite graphs and lattices , 1971 .

[35]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[36]  Charles J. Alpert,et al.  Spectral Partitioning: The More Eigenvectors, The Better , 1995, 32nd Design Automation Conference.

[37]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[38]  D. Rose,et al.  Generalized nested dissection , 1977 .

[39]  Bruce Hendrickson,et al.  Improving the Run Time and Quality of Nested Dissection Ordering , 1998, SIAM J. Sci. Comput..

[40]  Joseph W. H. Liu,et al.  On Finding Supernodes for Sparse Matrix Computations , 1993, SIAM J. Matrix Anal. Appl..

[41]  Florin Dobrian,et al.  External Memory Algorithms for Factoring Sparse Matrices , 2001 .

[42]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[43]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[44]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[45]  J. S. Rowlinson,et al.  Molecular Thermodynamics of Fluid-Phase Equilibria , 1969 .

[46]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[47]  H. Niessner,et al.  On computing the inverse of a sparse matrix , 1983 .

[48]  A. Ciric,et al.  Steady State Multiplicities in an Ethylene Glycol Reactive Distillation Column , 1994 .