Two models of two-dimensional bandwidth problems
DOI10.1016/J.IPL.2010.04.013zbMATH Open1229.68058OpenAlexW1968798293MaRDI QIDQ656608FDOQ656608
Authors: Lan Lin, Yanpei Liu 
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.013
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- VLSI layouts of complete graphs and star graphs
- A framework for solving VLSI graph layout problems
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- The bandwidth problem for graphs and matrices—a survey
- The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
- The complexity of minimizing wire lengths in VLSI layouts
- Title not available (Why is that?)
Cited In (5)
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)
