Bounding the bandwidths for graphs
From MaRDI portal
Publication:1583541
DOI10.1016/S0304-3975(00)00068-2zbMath0949.68120MaRDI QIDQ1583541
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item