Two models of two-dimensional bandwidth problems
From MaRDI portal
Publication:656608
Recommendations
- scientific article; zbMATH DE number 1778090
- scientific article; zbMATH DE number 1161364
- scientific article; zbMATH DE number 1159116
- scientific article; zbMATH DE number 1263932
- Square-root rule of two-dimensional bandwidth problem
- On bandwidth-2 graphs
- Tight bounds for bandwidth allocation on two links
- scientific article; zbMATH DE number 1895637
- The Effective Bandwidth Problem Revisited
- On Some Variants of the Bandwidth Minimization Problem
Cites work
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 1159116 (Why is no real title available?)
- A framework for solving VLSI graph layout problems
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
- The bandwidth problem for graphs and matrices—a survey
- The complexity of minimizing wire lengths in VLSI layouts
- VLSI layouts of complete graphs and star graphs
Cited in
(5)- Bandwidth reduction in rectangular grids
- Square-root rule of two-dimensional bandwidth problem
- scientific article; zbMATH DE number 2016615 (Why is no real title available?)
- scientific article; zbMATH DE number 1778090 (Why is no real title available?)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
This page was built for publication: Two models of two-dimensional bandwidth problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656608)