On the public citation graph
Note on minimizing the bandwidth of sparse, symmetric matrices
0 signed · 27 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/bf02252900openalex-snapshot
Minimizing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cnm.1640101107openalex-snapshot
A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
inferred← citeshttps://doi.org/10.1002/cnm.1640111205openalex-snapshot
Finite element nodal ordering algorithms
inferred← citeshttps://doi.org/10.1002/jgt.3190060302openalex-snapshot
The bandwidth problem for graphs and matrices—a survey
inferred← citeshttps://doi.org/10.1002/nme.1620230909openalex-snapshot
A new mode renumbering algorithm for bandwidth reduction
inferred← citeshttps://doi.org/10.1002/nme.1620240915openalex-snapshot
A new node renumbering algorithm for bandwidth reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-02964-1_4openalex-snapshot
Ordering for Optimal Patterns of Structural Matrices: Graph Theory Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-97289-3_12openalex-snapshot
Multi-dimensional Banded Pattern Mining
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf02280884openalex-snapshot
The NP-Completeness of the bandwidth minimization problem
inferred← citeshttps://doi.org/10.1016/0045-7949(86)90318-4openalex-snapshot
Ordering for bandwidth reduction
inferred← citeshttps://doi.org/10.1016/0045-7949(91)90257-mopenalex-snapshot
A connectivity coordinate system for node and element ordering
inferred← citeshttps://doi.org/10.1016/j.orl.2011.08.005openalex-snapshot
A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
inferred← citeshttps://doi.org/10.1016/s0141-0296(97)00047-3openalex-snapshot
Comparative study of finite element nodal ordering methods
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1080/00207168408803418openalex-snapshot
A general strategy on the bandwidth minimization (BM) problem
inferred← citeshttps://doi.org/10.1108/02644400910943644openalex-snapshot
Nodal ordering for bandwidth reduction using ant system algorithm
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1137/0215041openalex-snapshot
On the Probable Performance of Heuristics for Bandwidth Minimization
inferred← citeshttps://doi.org/10.18057/ijasc.2006.2.1.3openalex-snapshot
EFFICIENT MODELLING OF COMPOSITE BUILDING RESPONSE TO COMPARTMENT FIRES
inferred← citeshttps://doi.org/10.56471/slujst.v4i.278openalex-snapshot
Using Parametric Test to determine the Significance of Banded patterns in N-dimensional 0-1 dataset
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.