The online graph bandwidth problem
From MaRDI portal
Recommendations
- The bandwidth problem and operations on graphs
- scientific article; zbMATH DE number 1186230
- scientific article; zbMATH DE number 3859182
- scientific article; zbMATH DE number 1617243
- scientific article; zbMATH DE number 2016615
- Bounding the bandwidths for graphs
- On the size of graphs of a given bandwidth
- A randomized online algorithm for bandwidth utilization
- scientific article; zbMATH DE number 2119708
- On bandwidth-2 graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3993569 (Why is no real title available?)
- A provably efficient algorithm for dynamic storage allocation
- An Effective Version of Dilworth's Theorem
- Competitive algorithms for server problems
- Effective coloration
- Lower bounds for on-line two-dimensional packing algorithms
- New Algorithms for Bin Packing
- New Ressults on Server Problems
- On the Probable Performance of Heuristics for Bandwidth Minimization
- On-line and first fit colorings of graphs
- Recursive coloration of countable graphs
- The Linearity of First-Fit Coloring of Interval Graphs
- The NP-completeness of the bandwidth minimization problem
Cited in
(3)
This page was built for publication: The online graph bandwidth problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198951)