On the public citation graph
On the Performance of the Minimum Degree Ordering for Gaussian Elimination
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1109/proc.1967.6011openalex-snapshot
Direct solutions of sparse network equations by optimally ordered triangular factorization
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1137/0715006openalex-snapshot
On the Application of the Minimum Degree Algorithm to Finite Element Systems
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.7146/dpb.v9i123.6541openalex-snapshot
Direct Methods for Sparse Matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44666-4_9openalex-snapshot
An Online Algorithm for the Postman Problem with a Small Penalty
inferred← citeshttps://doi.org/10.1007/3-540-45262-1_16openalex-snapshot
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_22openalex-snapshot
Parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_11openalex-snapshot
Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1021908421589openalex-snapshot
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/focs.2018.00019openalex-snapshot
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646116openalex-snapshot
Parallelizing elimination orders with linear fill
inferred← citeshttps://doi.org/10.1137/1.9781611976465.45openalex-snapshot
A Fast Minimum Degree Algorithm and Matching Lower Bound
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479801385037openalex-snapshot
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
inferred← citeshttps://doi.org/10.1137/s0895479896299081openalex-snapshot
Robust Ordering of Sparse Matrices using Multisection
inferred← citeshttps://doi.org/10.1137/s0895479896302692openalex-snapshot
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
inferred← citeshttps://doi.org/10.1137/s0895479897319313openalex-snapshot
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s1064827596300656openalex-snapshot
Improving the Run Time and Quality of Nested Dissection Ordering
inferred← citeshttps://doi.org/10.1145/1378533.1378559openalex-snapshot
Graph partitioning into isolated, high conductance clusters
inferred← citeshttps://doi.org/10.1145/305619.305640openalex-snapshot
Tradeoffs between parallelism and fill in nested dissection
inferred← citeshttps://doi.org/10.2172/15013116openalex-snapshot
Object-oriented algorithmic laboratory for ordering sparse matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1711.08446openalex-snapshot
On Computing Min-Degree Elimination Orderings
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.