Bounding the bandwidths for graphs

DOI10.1016/S0304-3975(00)00068-2zbMATH Open0949.68120MaRDI QIDQ1583541FDOQ1583541

Sanming Zhou

Publication date: 26 October 2000

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

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

zbMATH Keywords

bandwidthVLSI layoutcyclic bandwidth

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Title not available (Why is that?)
• The bandwidth problem and operations on graphs
• Bandwidth on AT-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph bandwidth of weighted caterpillars
• Bandwidth of chain graphs
• On the bandwidth of triangulated triangles
• The online graph bandwidth problem
• Discovering bands from graphs
• Title not available (Why is that?)
• New results on edge-bandwidth
• Distance-two labellings of Hamming graphs
• Tabu search for the cyclic bandwidth problem
• Title not available (Why is that?)
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• On bandwidth sums of graphs
• Undecidability of the bandwidth problem on linear graph languages
• New classes of extremal graphs with given bandwidth
• Title not available (Why is that?)
• Approximating the Bandwidth for Asteroidal Triple-Free Graphs
• Title not available (Why is that?)
• On the size of graphs of a given bandwidth
• On bandwidth-2 graphs
• On the bandwidth of 3-dimensional Hamming graphs

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)