Fetching the paper…
Reading the bibliography…
We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination.
An introduction to probability theory and its applications. Vol. II
William Feller · 1971
Earlier work this paper cites.
Nested dissection of a regular finite element mesh
Alan George · 1973
Earlier work this paper cites.
A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations
D. J. Rose · 1973
Earlier work this paper cites.
Algorithmic aspects of vertex elimination on graphs
Donald J. Rose, Robert Endre Tarjan, and George S. Lueker · 1976
Earlier work this paper cites.
Generalized nested dissection
R. J. Lipton, D. J. Rose, and R. E. Tarjan · 1979
Earlier work this paper cites.
A planar separator theorem
R. J. Lipton and R. E. Tarjan · 1979
Earlier work this paper cites.
Computer Solution of Large Sparse Positive Definite
Alan George and Joseph W. Liu · 1981
Earlier work this paper cites.
Computing the minimum fill-in is np-complete
Mihalis Yannakakis · 1981
Earlier work this paper cites.
Probabilistic counting algorithms for data base applications
Philippe Flajolet and G. Nigel Martin · 1985
Earlier work this paper cites.
Modification of the minimum-degree algorithm by multiple elimination
Joseph WH Liu · 1985
Earlier work this paper cites.
The analysis of a nested dissection algorithm
J. R. Gilbert and R. E. Tarjan · 1987
Earlier work this paper cites.
The evolution of the minimum degree ordering algorithm
A. George and W. H. Liu · 1989
Earlier work this paper cites.
Lapack: A portable linear algebra library for high-performance computers
E. Anderson, Z. Bai, J. Dongarra, A. Greenbaum, A. McKenney, J. Du Croz, S. Hammarling, J. Demmel, C. Bischof, and D. Sorensen · 1990
Earlier work this paper cites.
On the performance of the minimum degree ordering for gaussian elimination
Piotr Berman and Georg Schnitger · 1990
Earlier work this paper cites.
The role of elimination trees in sparse factorization
Joseph WH Liu · 1990
Earlier work this paper cites.
Chapter ii. backwards analysis of randomized geometric algorithms
Raimund Seidel · 1993
Earlier work this paper cites.
An efficient algorithm to compute row and column counts for sparse Cholesky factorization
John R Gilbert, Esmond G Ng, and Barry W Peyton · 1994
Earlier work this paper cites.
An approximate minimum degree ordering algorithm
Patrick R. Amestoy, Timothy A. Davis, and Iain S. Duff · 1996
Earlier work this paper cites.
Randomized search trees
Raimund Seidel and Cecilia R Aragon · 1996
Earlier work this paper cites.
Size-estimation framework with applications to transitive closure and reachability
Edith Cohen · 1997
Earlier work this paper cites.
Covering graphs: The covering problem solved
Yair Caro and Raphael Yuster · 1998
Cited alongside, same era.
Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs
Haim Kaplan, Ron Shamir, and Robert E Tarjan · 1999
Cited alongside, same era.
A polynomial approximation algorithm for the minimum fill-in problem
Assaf Natanzon, Ron Shamir, and Roded Sharan · 2000
Cited alongside, same era.
The computational complexity of the minimum degree algorithm
Pinar Heggernes, SC Eisestat, Gary Kumfert, and Alex Pothen · 2001
Cited alongside, same era.
Algorithm 837: Amd, an approximate minimum degree ordering algorithm
Patrick R. Amestoy, Timothy A. Davis, and Iain S. Duff · 2004
Cited alongside, same era.
A column approximate minimum degree ordering algorithm
Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, and Esmond G. Ng · 2004
Parallel graph decompositions using random shifts
Gary L. Miller, Richard Peng, and Shen Chen Xu · 2013
Later among the works it cites.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Later among the works it cites.
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
D. Spielman and S. Teng · 2014
Later among the works it cites.
Inapproximability of treewidth and related problems
Yu Wu, Per Austrin, Toniann Pitassi, and David Liu · 2014
Later among the works it cites.
Fully dynamic maximal matching in O ( log n CLOSE O(\log{n} update time
Surender Baswana, Manoj Gupta, and Sandeep Sen · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An improved data stream summary: The count-min sketch and its applications
Graham Cormode and S. Muthukrishnan · 2005
Cited alongside, same era.
A new algorithm for optimal 2 2 -constraint satisfaction and its implications
Ryan Williams · 2005
Cited alongside, same era.
Combinatorial scientific computing: The enabling power of discrete algorithms in computational science
Bruce Hendrickson and Alex Pothen · 2007
Cited alongside, same era.
Introduction to Algorithms, Third Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein · 2009
Cited alongside, same era.
Solving linear systems through nested dissection
Noga Alon and Raphael Yuster · 2010
Cited alongside, same era.
Probabilistic search algorithms with unique answers and their cryptographic applications
Eran Gat and Shafi Goldwasser · 2011
Cited alongside, same era.
Yin Tat Lee and Aaron Sidford · 2015
Later among the works it cites.
Improved parallel algorithms for spanners and hopsets
Gary L Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu · 2015
Later among the works it cites.
Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis
Virginia V. Williams · 2015
Later among the works it cites.
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
Ivan Bliznets, Marek Cygan, Paweł Komosa, Lukáš Mach, and Michał Pilipczuk · 2016
Later among the works it cites.
Approximate gaussian elimination for laplacians-fast, sparse, and simple
Rasmus Kyng and Sushant Sachdeva · 2016
Later among the works it cites.
Fully dynamic maximal matching in constant update time
Shay Solomon · 2016
Later among the works it cites.
Minimum fill-in: Inapproximability and almost tight lower bounds
Yixin Cao and R. B. Sandeep · 2017
Closest in time.
Approximately counting triangles in sublinear time
Talya Eden, Amit Levi, Dana Ron, and C Seshadhri · 2017
Closest in time.
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P Woodruff, and Mobin Yahyazadeh · 2017
Closest in time.
A hybrid sampling scheme for triangle counting
John Kallaugher and Erie Price · 2017
Closest in time.
A framework for analyzing resparsification algorithms
Rasmus Kyng, Jakub Pachocki, Richard Peng, and Sushant Sachdeva · 2017
Closest in time.
Hardness results for structured linear systems
Rasmus Kyng and Peng Zhang · 2017
Closest in time.
The MathWorks, Natick, MA, USA
MATLAB optimization toolbox, 2017 · 2017
Closest in time.
Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
Hadi Pouransari, Pieter Coulier, and Eric Darve · 2017
Closest in time.