Bounding the bandwidths for graphs

DOI10.1016/S0304-3975(00)00068-2zbMath0949.68120MaRDI QIDQ1583541

Sanming Zhou

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bandwidthcyclic bandwidthVLSI layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

New results on edge-bandwidth ⋮ Tabu search for the cyclic bandwidth problem ⋮ Distance-two labellings of Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• The NP-completeness of the bandwidth minimization problem
• Parallel concepts in graph theory
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Interpolation theorems for graphs, hypergraphs and matroids
• The bandwidth problem for graphs and matrices—a survey
• Optimal numberings and isoperimetric problems on graphs
• A remark on a problem of Harary

This page was built for publication: Bounding the bandwidths for graphs