Bounding the bandwidths for graphs

DOI10.1016/S0304-3975(00)00068-2MaRDI QIDQ1583541zbMATHFDO

Authors Sanming Zhou

Publication date 26 October 2000

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

zbMATH Keywords

bandwidthVLSI layoutcyclic bandwidth

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1045605
• Bandwidth and density for block graphs
• Publication:4940077
• scientific article; zbMATH DE number 812088
• scientific article; zbMATH DE number 4120213

Cites work

• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 568819 (Why is no real title available?)
• scientific article; zbMATH DE number 719423 (Why is no real title available?)
• scientific article; zbMATH DE number 1045605 (Why is no real title available?)
• scientific article; zbMATH DE number 862540 (Why is no real title available?)
• A framework for solving VLSI graph layout problems
• A remark on a problem of Harary
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Interpolation theorems for graphs, hypergraphs and matroids
• Optimal numberings and isoperimetric problems on graphs
• Parallel concepts in graph theory
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey

Cited in

(26)

• scientific article; zbMATH DE number 436077 (Why is no real title available?)
• scientific article; zbMATH DE number 3963886 (Why is no real title available?)
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Distance-two labellings of Hamming graphs
• scientific article; zbMATH DE number 867648 (Why is no real title available?)
• New results on edge-bandwidth
• Undecidability of the bandwidth problem on linear graph languages
• Tabu search for the cyclic bandwidth problem
• scientific article; zbMATH DE number 812088 (Why is no real title available?)
• Discovering bands from graphs
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• On bandwidth sums of graphs
• New classes of extremal graphs with given bandwidth
• Graph bandwidth of weighted caterpillars
• The bandwidth problem and operations on graphs
• On the bandwidth of 3-dimensional Hamming graphs
• On bandwidth-2 graphs
• Bandwidth on AT-free graphs
• Approximating the Bandwidth for Asteroidal Triple-Free Graphs
• The online graph bandwidth problem
• Bandwidth of chain graphs
• On the bandwidth of triangulated triangles
• scientific article; zbMATH DE number 1151836 (Why is no real title available?)
• scientific article; zbMATH DE number 786174 (Why is no real title available?)
• scientific article; zbMATH DE number 434870 (Why is no real title available?)
• On the size of graphs of a given bandwidth

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

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