A new matrix bandwidth reduction algorithm

DOI10.1016/S0167-6377(98)00040-6zbMath0941.90075OpenAlexW2016287305MaRDI QIDQ1306383

L. Tarricone, A. Esposito, M. S. Fiorenzo Catalano, Federico Malucelli

Publication date: 19 December 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00040-6

zbMATH Keywords

graph partitioningbottleneck assignmentmatrix bandwith reductionnode renumbering

Mathematics Subject Classification ID

Mathematical programming (90C99)

Related Items (3)

A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs ⋮ An improved simulated annealing algorithm for bandwidth minimization ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Solution methods and computational investigations for the linear bottleneck assignment problem
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• The bandwidth problem for graphs and matrices—a survey
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• The Profile Minimization Problem in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new matrix bandwidth reduction algorithm