On the public citation graph

Equivalent Sparse Matrix Reordering by Elimination Tree Rotations

0 signed · 94 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0020-0190(80)90136-2openalex-snapshot
The space complexity of pebble games on trees
inferredcites →https://doi.org/10.1016/0167-8191(86)90014-1openalex-snapshot
Computational models and task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
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.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0608031openalex-snapshot
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0908053openalex-snapshot
An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/214392.214398openalex-snapshot
Modification of the minimum-degree algorithm by multiple elimination
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1145/6497.6499openalex-snapshot
A compact row storage scheme for Cholesky factors using elimination trees
inferredcites →https://doi.org/10.1145/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11558958_95openalex-snapshot
Simple and Efficient Modifications of Elimination Orderings
inferred← citeshttps://doi.org/10.1007/3-540-18991-2_29openalex-snapshot
A parallel graph partitioning algorithm for a message-passing multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_22openalex-snapshot
Parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_7openalex-snapshot
The Complexity of Bicriteria Tree-Depth
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_6openalex-snapshot
The Minimum Degree Heuristic and the Minimal Triangulation Process
inferred← citeshttps://doi.org/10.1007/978-3-662-39812-8_2openalex-snapshot
Solution of Sparse Systems of Equations on Multiprocessor Architectures
inferred← citeshttps://doi.org/10.1007/bf01388998openalex-snapshot
A parallel graph partitioning algorithm for a message-passing multiprocessor
inferred← citeshttps://doi.org/10.1007/bf02023054openalex-snapshot
Parallel sparse Gaussian elimination with partial pivoting
inferred← citeshttps://doi.org/10.1007/bfb0002824openalex-snapshot
A parallel sparse LU decomposition with application to semiconductor device simulation
inferred← citeshttps://doi.org/10.1007/bfb0085717openalex-snapshot
Solution of sparse systems of equations on multiprocessor architectures
inferred← citeshttps://doi.org/10.1016/0167-8191(88)90039-7openalex-snapshot
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90064-1openalex-snapshot
Reordering sparse matrices for parallel elimination
inferred← citeshttps://doi.org/10.1016/0377-0427(89)90364-6openalex-snapshot
Solution of sparse positive definite systems on a hypercube
inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50012-8openalex-snapshot
Solution of sparse positive definite systems on a hypercube* *Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research, U.S. Department of Energy, and by the Canadian Natural Sciences and Engineering Research Council under grant A5509.
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.003openalex-snapshot
Minimal triangulations of graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.001openalex-snapshot
A wide-range algorithm for minimal triangulation from an arbitrary ordering
inferred← citeshttps://doi.org/10.1016/j.jcp.2013.01.036openalex-snapshot
A fast algorithm for sparse matrix computations related to inversion
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.059openalex-snapshot
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.032openalex-snapshot
The complexity of bicriteria tree-depth
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00126-7openalex-snapshot
A practical algorithm for making filled graphs minimal
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.1016/s1570-8659(04)13008-1openalex-snapshot
Solution of Linear Systems
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1021/ct100618sopenalex-snapshot
Fast Sparse Cholesky Decomposition and Inversion using Nested Dissection Matrix Reordering
inferred← citeshttps://doi.org/10.1080/00207169808804670openalex-snapshot
Reordering for parallelism
inferred← citeshttps://doi.org/10.1080/10556788.2012.684353openalex-snapshot
Logarithmic barriers for sparse matrix cones
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0001openalex-snapshot
Glossary of Symbols
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0005openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0006openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0002openalex-snapshot
Sparse matrices: storage schemes and simple operations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0003openalex-snapshot
Gaussian elimination for dense matrices: the algebraic problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0004openalex-snapshot
Gaussian elimination for dense matrices: numerical considerations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0005openalex-snapshot
Gaussian elimination for sparse matrices: an introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0006openalex-snapshot
Reduction to block triangular form
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0007openalex-snapshot
Local pivotal strategies for sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0008openalex-snapshot
Ordering sparse matrices for band solution
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0009openalex-snapshot
Orderings based on dissection
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0010openalex-snapshot
Implementing Gaussian elimination without symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0011openalex-snapshot
Implementing Gaussian elimination with symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0012openalex-snapshot
Gaussian elimination using trees
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0013openalex-snapshot
Graphs for symmetric and unsymmetric matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0014openalex-snapshot
The solve phase
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0015openalex-snapshot
Other sparsity-oriented issues
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0001openalex-snapshot
Matrix and vector norms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0002openalex-snapshot
Pictures of sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0003openalex-snapshot
Solutions to selected exercises
inferred← citeshttps://doi.org/10.1109/icpads.2016.0107openalex-snapshot
A Fine-Grained Parallel Power Flow Method for Large Scale Grid Based on Lightweight GPU Threads
inferred← citeshttps://doi.org/10.1109/icpp.1993.117openalex-snapshot
Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00059openalex-snapshot
Scalability Challenges of an Industrial Implicit Finite Element Code
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296723openalex-snapshot
A reordering and mapping algorithm for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/superc.1994.344280openalex-snapshot
A parallel formulation of interior point algorithms
inferred← citeshttps://doi.org/10.1109/tcad.2004.826549openalex-snapshot
Multigranular Parallel Algorithms for Solving Linear Equations in VLSI Circuit Simulation
inferred← citeshttps://doi.org/10.1109/tpds.2003.1195411openalex-snapshot
Processor allocation and task scheduling of matrix chain products on parallel systems
inferred← citeshttps://doi.org/10.1134/s1995423910030055openalex-snapshot
Building graph separators with the recursive rotation algorithm for the nested dissection method
inferred← citeshttps://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferred← citeshttps://doi.org/10.1137/0611028openalex-snapshot
A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
inferred← citeshttps://doi.org/10.1137/070680680openalex-snapshot
Fast Computation of Minimal Fill Inside A Given Elimination Ordering
inferred← citeshttps://doi.org/10.1137/1.9781611977073.84openalex-snapshot
Efficient generation of elimination trees and graph associahedra
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/1034004openalex-snapshot
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
inferred← citeshttps://doi.org/10.1137/s0895479802419877openalex-snapshot
Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
inferred← citeshttps://doi.org/10.1137/s0895479803386354openalex-snapshot
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
inferred← citeshttps://doi.org/10.1137/s0895479893244353openalex-snapshot
Sparse Multifrontal Rank Revealing QR Factorization
inferred← citeshttps://doi.org/10.1137/s1064827598339372openalex-snapshot
Orderings for Factorized Sparse Approximate Inverse Preconditioners
inferred← citeshttps://doi.org/10.1145/3689633openalex-snapshot
Combinatorial Generation via Permutation Languages. IV. Elimination Trees
inferred← citeshttps://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferred← citeshttps://doi.org/10.1145/76909.76911openalex-snapshot
The multifrontal method and paging in sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.2172/10145949openalex-snapshot
An introduction to chordal graphs and clique trees
inferred← citeshttps://doi.org/10.2172/6560471openalex-snapshot
An introduction to chordal graphs and clique trees
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.