scientific article; zbMATH DE number 798643

zbMATH Open0833.68094MaRDI QIDQ4848765FDOQ4848765

Authors: Janice Jeffs, G. W. Dueck 

Publication date: 11 March 1996

Title of this publication is not available (Why is that?)

Recommendations

• Heuristics for matrix bandwidth reduction
• Bandwidth reduction by simulated annealing
• A constructive bandwidth reduction algorithm
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• An improved simulated annealing algorithm for bandwidth minimization

zbMATH Keywords

bandwidthbandwidth reduction algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (11)

• Reducing the bandwidth of a sparse matrix with tabu search.
• An improved simulated annealing algorithm for bandwidth minimization
• Title not available (Why is that?)
• Heuristics for matrix bandwidth reduction
• GRASP and path relinking for the matrix bandwidth minimization.
• Optimal linear labelings and eigenvalues of graphs
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Bandwidth reduction by simulated annealing
• Variable neighbourhood search for bandwidth reduction
• Adaptive memory programming for matrix bandwidth minimization

This page was built for publication:

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