On the public citation graph
Toward Characterization of Perfect Elimination Digraphs
0 signed · 38 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.1007/978-1-4615-8675-3_16openalex-snapshot
The Role of Partitioning in the Numerical Solution of Sparse Systems
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
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.1137/0710033openalex-snapshot
Complexity Bounds for Regular Finite Difference and Finite Element Grids
inferredcites →https://doi.org/10.2307/2004501openalex-snapshot
Computer Solution of Linear Algebraic Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.4490050206openalex-snapshot
A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
inferred← citeshttps://doi.org/10.1002/jgt.3190020209openalex-snapshot
Perfect Elimination and Chordal Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_4openalex-snapshot
Structural Representations of Schur Complements in Sparse Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_25openalex-snapshot
Semi-strict Chordal Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_3openalex-snapshot
Introduction to Matrix Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_35openalex-snapshot
Recognizing Sparse Perfect Elimination Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-024-02778-5openalex-snapshot
Semi-strict Chordality of Digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90042-9openalex-snapshot
On simple characterizations of k-trees
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90043-5openalex-snapshot
An algorithm for testing chordality of graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90101-6openalex-snapshot
Recognition of perfect elimination bipartite graphs
inferred← citeshttps://doi.org/10.1016/0022-247x(74)90179-6openalex-snapshot
Partitioning, tearing and modification of sparse linear systems
inferred← citeshttps://doi.org/10.1016/0022-247x(78)90053-7openalex-snapshot
A note on perfect Gaussian elimination
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50019-4openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.005openalex-snapshot
Digraphs of bounded elimination width
inferred← citeshttps://doi.org/10.1016/j.dam.2016.02.009openalex-snapshot
Strict chordal and strict split digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112362openalex-snapshot
Chordality of locally semicomplete and weakly quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113829openalex-snapshot
Comparability digraphs: An analogue of comparability graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80060-8openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/s0195-6698(88)80051-9openalex-snapshot
A Remark on Perfect Gaussian Elimination of Symmetric Matrices
inferred← citeshttps://doi.org/10.1017/s1446788700027300openalex-snapshot
Decomposable graphs and hypergraphs
inferred← citeshttps://doi.org/10.1080/15326349908807564openalex-snapshot
A graph-theoretic approach to queueing analysis part i: theory
inferred← citeshttps://doi.org/10.1109/tcs.1976.1084160openalex-snapshot
A note on bipartite graphs and pivot selection in sparse matrices
inferred← citeshttps://doi.org/10.1109/tcs.1984.1085419openalex-snapshot
Some applications of graph theory to network analysis and synthesis
inferred← citeshttps://doi.org/10.1137/0134014openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Directed Graphs
inferred← citeshttps://doi.org/10.1137/0203023openalex-snapshot
Reversal-Bounded Acceptors and Intersections of Linear Languages
inferred← citeshttps://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferred← citeshttps://doi.org/10.1137/20m1316056openalex-snapshot
Strong Chordality of Graphs with Possible Loops
inferred← citeshttps://doi.org/10.1145/800116.803775openalex-snapshot
Algorithmic aspects of vertex elimination
inferred← citeshttps://doi.org/10.2172/5206570openalex-snapshot
Finite sparse matrix techniques. [Solution of linear systems Ax = b]
inferred← citeshttps://doi.org/10.3990/1.9789036534765openalex-snapshot
Bipartite graphs and the decomposition of systems of equations
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.