Nodal ordering for bandwidth reduction using ant system algorithm

DOI10.1108/02644400910943644MaRDI QIDQ4908056zbMATH OpenOpenAlexFDO

Authors P. Sharafi, A. Kaveh

Publication date 27 February 2013

Published in Engineering Computations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/02644400910943644

zbMATH Keywords

graph theorytreesbandwidthsprogramming and algorithm theory

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational methods for sparse matrices (65F50)

Recommendations

• Ordering for bandwidth reduction
• Bandwidth reduction of rectangular matrices
• Reducing the bandwidth of a sparse matrix with tabu search.
• A constructive bandwidth reduction algorithm
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices

Cites work

• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• A connectivity coordinate system for node and element ordering
• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An algorithm for profile and wavefront reduction of sparse matrices
• Note on minimizing the bandwidth of sparse, symmetric matrices
• Ordering for bandwidth reduction

Cited in

(4)

• Bio-inspired components for a bandwidth problem
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• Ordering for bandwidth reduction

This page was built for publication: Nodal ordering for bandwidth reduction using ant system algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908056)