Nodal ordering for bandwidth reduction using ant system algorithm

DOI10.1108/02644400910943644zbMath1257.65024OpenAlexW2042786349MaRDI QIDQ4908056

P. Sharafi, Ali 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

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

Related Items (2)

A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs ⋮ A constructive bandwidth reduction algorithm -- a variant of GPS algorithm

Cites Work

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

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