Pages that link to "Item:Q2561468"
From MaRDI portal
The following pages link to Minimizing the bandwidth of sparse symmetric matrices (Q2561468):
Displaying 11 items.
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- The NP-completeness of the bandwidth minimization problem (Q1223124) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction (Q1913169) (← links)
- Note on minimizing the bandwidth of sparse, symmetric matrices (Q2559235) (← links)
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions (Q3382786) (← links)
- Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607) (← links)
- Graph layout problems (Q5096816) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
