scientific article; zbMATH DE number 798643

MaRDI QIDQ4848765zbMATH OpenFDO

Authors Janice Jeffs, G. W. Dueck

Publication date 11 March 1996

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)

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

Cited in

(11)

• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• GRASP and path relinking for the matrix bandwidth minimization.
• Variable neighbourhood search for bandwidth reduction
• Heuristics for matrix bandwidth reduction
• Optimal linear labelings and eigenvalues of graphs
• Reducing the bandwidth of a sparse matrix with tabu search.
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• scientific article; zbMATH DE number 2079803 (Why is no real title available?)
• Bandwidth reduction by simulated annealing
• Adaptive memory programming for matrix bandwidth minimization
• An improved simulated annealing algorithm for 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)