The online graph bandwidth problem
From MaRDI portal
Publication:1198951
DOI10.1016/0890-5401(92)90012-5zbMath0752.68060MaRDI QIDQ1198951
Publication date: 16 January 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90012-5
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive coloration of countable graphs
- A provably efficient algorithm for dynamic storage allocation
- Lower bounds for on-line two-dimensional packing algorithms
- The NP-completeness of the bandwidth minimization problem
- New Ressults on Server Problems
- Competitive algorithms for server problems
- On the Probable Performance of Heuristics for Bandwidth Minimization
- On-line and first fit colorings of graphs
- The Linearity of First-Fit Coloring of Interval Graphs
- New Algorithms for Bin Packing
- An Effective Version of Dilworth's Theorem
- Effective coloration