A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 975329 (Why is no real title available?)
- A connectivity coordinate system for node and element ordering
- A new matrix bandwidth reduction algorithm
- A two‐step approach to finite element ordering
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
- Heuristics for matrix bandwidth reduction
- Nodal ordering for bandwidth reduction using ant system algorithm
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- Note on minimizing the bandwidth of sparse, symmetric matrices
- Ordering for bandwidth reduction
- Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
- Structural mechanics: Graph and matrix methods.
- The bandwidth problem for graphs and matrices—a survey
Cited in
(5)
This page was built for publication: A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408436)