On the public citation graph

Minimizing the bandwidth of sparse symmetric matrices

https://doi.org/10.1007/bf02252900
0 signed · 46 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.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2005268openalex-snapshot
Large Sparse Sets of Linear Equations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199906)31:2<75::aid-jgt1>3.0.co;2-sopenalex-snapshot
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
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.1620140606openalex-snapshot
A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
inferred← citeshttps://doi.org/10.1002/nme.1620201012openalex-snapshot
A hybrid algorithm for reducing matrix bandwidth
inferred← citeshttps://doi.org/10.1002/nme.1620211005openalex-snapshot
Near‐minimal matrix profiles and wavefronts for testing nodal resequencing algorithms
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_155openalex-snapshot
Approximation algorithms for the Bandwidth Minimization Problem for a large class of trees
inferred← citeshttps://doi.org/10.1007/978-3-319-95162-1_9openalex-snapshot
Finding a Starting Vertex for the Reverse Cuthill-McKee Method for Bandwidth Reduction: A Comparative Analysis Using Asymmetric Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-97289-3_12openalex-snapshot
Multi-dimensional Banded Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-662-49784-5_1openalex-snapshot
Banded Pattern Mining Algorithms in Multi-dimensional Zero-One Data
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf02090396openalex-snapshot
Bandwidth Minimization: An approximation algorithm for caterpillars
inferred← citeshttps://doi.org/10.1007/bf02239468openalex-snapshot
Note on minimizing the bandwidth of sparse, symmetric matrices
inferred← citeshttps://doi.org/10.1007/bf02259908openalex-snapshot
Bandwidth and pebbling
inferred← citeshttps://doi.org/10.1007/bf02280884openalex-snapshot
The NP-Completeness of the bandwidth minimization problem
inferred← citeshttps://doi.org/10.1007/bf02521587openalex-snapshot
Reducing the profile of sparse symmetric matrices
inferred← citeshttps://doi.org/10.1007/bf02679454openalex-snapshot
Approximation algorithms for the bandwidth minimization problem for a large class of trees
inferred← citeshttps://doi.org/10.1016/0045-7825(94)90005-1openalex-snapshot
Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
inferred← citeshttps://doi.org/10.1016/0045-7949(84)90082-8openalex-snapshot
Automatic node resequencing with constraints
inferred← citeshttps://doi.org/10.1016/0045-7949(86)90318-4openalex-snapshot
Ordering for bandwidth reduction
inferred← citeshttps://doi.org/10.1016/0045-7949(90)90196-9openalex-snapshot
Algebraic graph theory for ordering
inferred← citeshttps://doi.org/10.1016/0141-1195(80)90051-0openalex-snapshot
New renumbering algorithm for minimizing the bandwidth of sparse matrices
inferred← citeshttps://doi.org/10.1016/0141-1195(84)90027-5openalex-snapshot
Profile minimisation algorithm for sparse matrix
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90078-6openalex-snapshot
Bandwidth constraints on problems complete for polynomial time
inferred← citeshttps://doi.org/10.1016/b978-0-12-557580-5.50015-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.camwa.2003.06.009openalex-snapshot
Processor-efficient sparse matrix-vector multiplication
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.231openalex-snapshot
A Systematic Review of Heuristics for Profile Reduction of Symmetric Matrices
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.1101/2025.02.12.637964openalex-snapshot
DiVerG: Scalable Distance Index for Validation of Paired-End Alignments in Sequence Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364012openalex-snapshot
Finding banded patterns in big data using sampling
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/spdp.1990.143552openalex-snapshot
Approximation algorithms for the bandwidth minimization problem for caterpillar graphs
inferred← citeshttps://doi.org/10.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferred← citeshttps://doi.org/10.1137/0215041openalex-snapshot
On the Probable Performance of Heuristics for Bandwidth Minimization
inferred← citeshttps://doi.org/10.1137/0713023openalex-snapshot
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
inferred← citeshttps://doi.org/10.1137/20m1364461openalex-snapshot
Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
inferred← citeshttps://doi.org/10.1145/355705.355707openalex-snapshot
A Comparison of Several Bandwidth and Profile Reduction Algorithms
inferred← citeshttps://doi.org/10.1177/1687814015581979openalex-snapshot
Torsional stress in non-circular cross sections by the finite element method
inferred← citeshttps://doi.org/10.2208/jscej1969.1980.294_15openalex-snapshot
A GRAPH-THEORETIC CONSIDERATION ON MATRIX STRUCTURAL ANALYSIS
inferred← citeshttps://doi.org/10.2208/jscej1969.1981.314_29openalex-snapshot
A STUDY ON THE EFFECTIVITY OF THE BAND MATRIX METHOD IN NUMERICAL ANALYSIS
inferred← citeshttps://doi.org/10.4236/ajcm.2020.101006openalex-snapshot
On Solutions of Emden-Fowler Equation
inferred← citeshttps://doi.org/10.54966/jreen.v16i3.392openalex-snapshot
Solution de l’équation de Poisson dans un domaine bidimensionnel par la méthode des éléments finis
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.