A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs

DOI10.1016/j.orl.2011.08.005zbMath1238.05235OpenAlexW2038988417MaRDI QIDQ408436

P. Arathi, L. Jones Tarcius Doss

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

zbMATH Keywords

bandwidthL-structured graphssparse symmetric matrixZ-structured graphs

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for matrix bandwidth reduction
• 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
• The bandwidth problem for graphs and matrices—a survey
• A connectivity coordinate system for node and element ordering
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• A two‐step approach to finite element ordering
• Nodal ordering for bandwidth reduction using ant system algorithm
• An algorithm for reducing the bandwidth of a matrix of symmetrical configuration