A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
From MaRDI portal
Publication:408436
DOI10.1016/J.ORL.2011.08.005zbMATH Open1238.05235OpenAlexW2038988417MaRDI QIDQ408436FDOQ408436
Authors: L. Jones Tarcius Doss, P. Arathi
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.08.005
Recommendations
Computational methods for sparse matrices (65F50) Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Structural mechanics: Graph and matrix methods.
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- The bandwidth problem for graphs and matrices—a survey
- A new matrix bandwidth reduction algorithm
- Note on minimizing the bandwidth of sparse, symmetric matrices
- Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
- Ordering for bandwidth reduction
- A connectivity coordinate system for node and element ordering
- A two‐step approach to finite element ordering
- Nodal ordering for bandwidth reduction using ant system algorithm
- Title not available (Why is that?)
- An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
- Heuristics for matrix bandwidth reduction
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)